Homomorphisms and edge-colourings of planar graphs

  • Authors:
  • Reza Naserasr

  • Affiliations:
  • Department of Mathematics, Simon Fraser University, Burnaby BC, V5A 1S6, Canada

  • Venue:
  • Journal of Combinatorial Theory Series B
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.