Skip to main content
Log in

Group Chromatic Number of Graphs without K5-Minors

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 Let G be a graph with a fixed orientation and let A be a group. Let F(G,A) denote the set of all functions f: E(G) ↦A. The graph G is A -colorable if for any function fF(G,A), there is a function c: V(G) ↦A such that for every directed e=u vE(G), c(u)−c(v)≠f(e). The group chromatic numberχ1(G) of a graph G is the minimum m such that G is A-colorable for any group A of order at least m under a given orientation D.

In [J. Combin. Theory Ser. B, 56 (1992), 165–182], Jaeger et al. proved that if G is a simple planar graph, then χ1(G)≤6. We prove in this paper that if G is a simple graph without a K 5-minor, then χ1(G)≤5.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: August 18, 1999 Final version received: December 12, 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lai, HJ., Zhang, X. Group Chromatic Number of Graphs without K5-Minors. Graphs Comb 18, 147–154 (2002). https://doi.org/10.1007/s003730200009

Download citation

  • Issue Date:

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

Keywords

Navigation