EJC
2010
13 years 5 months ago
2010
EJC
2010
13 years 5 months ago
2010
Let S be a connected graph which contains an induced path of n-1 vertices, where n is the order of S. We consider a puzzle on S. A configuration of the puzzle is simply an n-dimen...
EJC
2010
13 years 5 months ago
2010
In a recent paper, Amini et al. introduced a general framework to prove duality theorems between tree decompositions and their dual combinatorial object. They unify all known ad-h...
EJC
2010
13 years 5 months ago
2010
A graph is k-linked (k-edge-linked), k 1, if for each k pairs of vertices x1, y1,
EJC
2010
13 years 5 months ago
2010
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
EJC
2010
13 years 5 months ago
2010
EJC
2010
13 years 5 months ago
2010
We further generalise a construction
EJC
2010
13 years 5 months ago
2010
We invesitage the multiplicative loops of finite semifields. We show that the group generated by the left and right multiplication maps contains the special linear group. This resu...
EJC
2010
13 years 5 months ago
2010
In our previous paper, we presented the combinatorial theory for minimal isostatic pinned frameworks - Assur graphs - which arise in the analysis of mechanical linkages. In this p...
EJC
2010
13 years 5 months ago
2010