Tutte's edge-coloring conjecture
Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
Universal H-colorable graphs without a given configuration
Discrete Mathematics
Graph Theory With Applications
Graph Theory With Applications
Homomorphism bounded classes of graphs
European Journal of Combinatorics
K5-free bound for the class of planar graphs
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
(2 + ε)-Coloring of planar graphs with large odd-girth
Journal of Graph Theory
Homomorphism bounded classes of graphs
European Journal of Combinatorics
Grad and classes with bounded expansion III. Restricted graph homomorphism dualities
European Journal of Combinatorics
Tension continuous maps-Their structure and applications
European Journal of Combinatorics
Hi-index | 0.00 |
We conjecture that every planar graph of odd-girth 2k+1 admits a homomorphism to the Cayley graph C(Z"2^2^k^+^1,S"2"k"+"1), with S"2"k"+"1 being the set of (2k+1)-vectors with exactly two consecutive 1's in a cyclic order. This is an strengthening of a conjecture of T. Marshall, J. Nesetril and the author. Our main result is to show that this conjecture is equivalent to the corresponding case of a conjecture of P. Seymour, stating that every planar (2k+1)-graph is (2k+1)-edge-colourable.