论文信息 - n-Tuple Coloring of Planar Graphs with Large Odd Girth

n-Tuple Coloring of Planar Graphs with Large Odd Girth

Abstract. The main result of the papzer is that any planar graph with odd girth at least 10k−7 has a homomorphism to the Kneser graph Gk2k+1, i.e. each vertex can be colored with k colors from the set {1,2,…,2k+1} so that adjacent vertices have no colors in common. Thus, for example, if the odd girth of a planar graph is at least 13, then the graph has a homomorphism to G25, also known as the Petersen graph. Other similar results for planar graphs are also obtained with better bounds and additional restrictions.

Cun-Quan Zhang | William Klostermeyer | Cun-Quan Zhang | W. Klostermeyer

[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[2] László Lovász,et al. Kneser's Conjecture, Chromatic Number, and Homotopy , 1978, J. Comb. Theory A.

[3] Cun-Quan Zhang,et al. (2 + ϵ)-Coloring of planar graphs with large odd-girth , 2000, J. Graph Theory.

[4] Branko Grünbaum. Grötzsch's theorem on $3$-colorings. , 1963 .

[5] A. Leaf. GRAPH THEORY AND PROBABILITY , 1957 .

[6] G. Hahn,et al. Graph homomorphisms: structure and symmetry , 1997 .

[7] Saul Stahl,et al. The multichromatic numbers of some Kneser graphs , 1998, Discret. Math..

[8] S. Stahl. n-Tuple colorings and associated graphs , 1976 .

[9] Carsten Thomassen,et al. Grötzsch's 3-Color Theorem and Its Counterparts for the Torus and the Projective Plane , 1994, J. Comb. Theory, Ser. B.