Skip to main content
SpringerLink
Log in

Every planar graph has an acyclic 7-coloring

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

A proper coloring of the vertices of a graph is said to be acyclic provided that no cycle is two colored. We prove that every planar graph has an acyclic seven coloring.

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

Access this article

Log in via an institution

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

References

  1. M. O. Albertson and D. M. Berman,The acyclic chromatic number, Proceedings of the Seventh Southeastern Conference on Combinatorics, Graph Theory, and Computing, Utilitas Mathematica Publishing Inc., Winnipeg, 1976, pp. 51–60.

    Google Scholar 

  2. K. Appel and W. Haken,The existence of unavoidable sets of geographically good configurations, Illinois J. Math.20 (1976), 218–297.

    MATH  MathSciNet  Google Scholar 

  3. B. Grünbaum,Acyclic colorings of planar graphs, Israel J. Math.14, (1973), 390–408.

    MATH  MathSciNet  Google Scholar 

  4. H. Heesch,Untersuchungen zum Vierfarbenproblem, B-I-Hochschulskripten 810/810a/810b, Bibliographisches Institut, Mannheim, 1969.

    MATH  Google Scholar 

  5. A. V. Kostochka,Acyclic 6-coloring of planar graphs, Diskret. Analiz., to appear (Russian).

  6. J. Mitchem,Every planar graph has an acyclic 8-coloring, Duke Math. J.41, (1974), 177–181.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Smith College, 01060, Northampton, Mass., USA

    Michael O. Albertson & David M. Berman

  2. Department of Mathematics, University of New Orleans, 70122, New Orleans, La., USA

    Michael O. Albertson & David M. Berman

Authors
  1. Michael O. Albertson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David M. Berman
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported in part by the Research Corporation through a Cottrell College Science Research Grant.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Albertson, M.O., Berman, D.M. Every planar graph has an acyclic 7-coloring. Israel J. Math. 28, 169–174 (1977). https://doi.org/10.1007/BF02759792

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation