EJC
2010
15 years 15 days ago
2010
79
Voted
EJC
2010
15 years 15 days 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
15 years 15 days 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...
73
Voted
EJC
2010
15 years 15 days ago
2010
A graph is k-linked (k-edge-linked), k 1, if for each k pairs of vertices x1, y1,
100
Voted
EJC
2010
15 years 15 days 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...
84
Voted
EJC
2010
15 years 15 days ago
2010
75
Voted
EJC
2010
15 years 15 days ago
2010
We further generalise a construction
64
Voted
EJC
2010
15 years 15 days 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...
88
Voted
EJC
2010
15 years 15 days 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...
67
Voted
EJC
2010
15 years 15 days ago
2010