Circular Chromatic Number of Planar Graphs of Large Odd Girth
Keyword(s):
It was conjectured by Jaeger that $4k$-edge connected graphs admit a $(2k+1, k)$-flow. The restriction of this conjecture to planar graphs is equivalent to the statement that planar graphs of girth at least $4k$ have circular chromatic number at most $2+ {{1}\over {k}}$. Even this restricted version of Jaeger's conjecture is largely open. The $k=1$ case is the well-known Grötzsch 3-colour theorem. This paper proves that for $k \geq 2$, planar graphs of odd girth at least $8k-3$ have circular chromatic number at most $2+{{1}\over {k}}$.
Keyword(s):
Keyword(s):
2020 ◽
Vol 12
(03)
◽
pp. 2050034
2002 ◽
Vol 81
(6)
◽
pp. 309-312
◽
1970 ◽
Vol 22
(5)
◽
pp. 1082-1096
◽
2020 ◽
Vol 12
(05)
◽
pp. 2050061
◽
2013 ◽
Vol 33
(4)
◽
pp. 756
◽