... tight.The odd edge-connectivity of a graph G is the size of a smallest odd edge cut of G.The odd girth of G is the length of a shortest odd cycle of G. Zhang [19] proposed a strengthing of Jaeger’s ... nothread of length at least 2k. For otherwise, for any internal vertex x of a thread of lengththe electronic journal of combinatorics 8 (2001), #R25 3Circular chromatic number of planar graphs of large odd ... Klostermeyer and C.Q.Zhang, (2+)-coloring of planar graphs with large odd girth,J. Graph Theory, 33(2000), 109-119.[10] D. Moser, The star chromatic number of planar graphs, J. Graph Theory, 24 (1997),33-43the...