n-Tuple Coloring of Planar Graphs with Large Odd Girth

  title={n-Tuple Coloring of Planar Graphs with Large Odd Girth},
  author={William Klostermeyer and Cun-Quan Zhang},
  journal={Graphs and Combinatorics},
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 G 2k‡1 k , i.e. each vertex can be colored with k colors from the set f1; 2;. .. ; 2k ‡ 1g 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 G 5 2 , also known as the Petersen graph. Other similar results for planar graphs are also obtained with better bounds and… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 13 references

n-Tuple colorings and associated graphs

  • S Stahl
  • J. Comb. Theory, Ser. B
  • 1976

Concerning the extension of the 3-coloring of planar graphs (in Russian). Diskrete Anal

  • V A Aksionov
  • Issled. Oper
  • 1974

GroÈ tzsch's theorem on 3-colorings

  • B Gruè Nbaum
  • Mich. Math. J
  • 1963

Graph theory and probability

  • P Erd} Os
  • Can. J. Math
  • 1959

Similar Papers

Loading similar papers…