Location of Repository

On Four Coloring Problems

By Jaroslav Nesetril and Eric Sopena

Abstract

. Coloring problems include some of the most classical combinatorial problems (such as map coloring problems or edge coloring of cubic graphs). But the area is alive and well beeing refreshed by a constant stream of new problems and solutions of old ones. In this paper we complement this by a survey of four particular problems which are all related to the notion of a homomorphism. This forms one of the most recent approaches to coloring problems. Keywords. Chromatic number, Planar graphs, Homomorphism, Gap, Density, Quasiordering, Oriented chromatic number, Game chromatic number.

Topics: Planar graphs, Homomorphism, Gap, Density, Quasiordering, Oriented chromatic number, Game chromatic number
Year: 1999
OAI identifier: oai:CiteSeerX.psu:10.1.1.29.838
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://dept-info.labri.u-borde... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.