Skip to main content
Log in

n-Tuple Coloring of Planar Graphs with Large Odd Girth

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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 G k 2 k +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 G 2 5, also known as the Petersen graph. Other similar results for planar graphs are also obtained with better bounds and additional restrictions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: June 14, 1999 Final version received: July 5, 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Klostermeyer, W., Zhang, C. n-Tuple Coloring of Planar Graphs with Large Odd Girth. Graphs Comb 18, 119–132 (2002). https://doi.org/10.1007/s003730200007

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730200007

Keywords

Navigation