Highly Influenced

# n-Tuple Coloring of Planar Graphs with Large Odd Girth

@article{Klostermeyer2002nTupleCO, title={n-Tuple Coloring of Planar Graphs with Large Odd Girth}, author={William Klostermeyer and Cun-Quan Zhang}, journal={Graphs and Combinatorics}, year={2002}, volume={18}, pages={119-132} }

- Published 2002 in Graphs and Combinatorics
DOI:10.1007/s003730200007

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 2k1 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