Skip to main content
SpringerLink
Log in

Four coloring for a subset of maximal planar graphs with minimum degree five

  • Graph Theory
  • Conference paper
  • First Online:
Book cover Combinatorics and Computer Science (CCS 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1120))

  • 179 Accesses

Abstract

In this paper, we present some results on maximal planar graphs with minimum degree five, denoted by MPG5 graphs [6]. We consider a subset of MPG5 graphs, called the \(\mathcal{Z}\) graphs, for which all vertices of degree superior to five are not adjacent. We give a vertex four coloring for every \(\mathcal{Z}\) graph.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Bernhart. Another reductible edge configuration, volume 70, pages 144–146. Amer. J; Math., 1948.

    Google Scholar 

  2. R. L. Brooks. On coloring the nodes of the network. In Proc. Cambridge Philos. Soc., volume 37, pages 194–197, 1941.

    Google Scholar 

  3. J. Hardouin Duparc and P. Rolland. Transformations for maximal planar graphs with minimum degree five. In Computing and Combinatorics, volume 959, pages 366–371. LNCS Springer Verlag, 1995.

    Google Scholar 

  4. A. Errera. Une contribution au problème des quatre couleurs. Bull. de la soc. Math. de France, 53:52–74, 1925.

    Google Scholar 

  5. A. B. Kempe. On the geographical problem of the four colours, volume 2, pages 193–200. Amer. J. Math., 1879.

    Google Scholar 

  6. C.A. Morgenstern and H.D. Shapiro. Heuristics for Rapidly Four-Coloring Large Planar Graphs, pages 869–891. Algorithmica. Springer-Verlag New York, 1991.

    Google Scholar 

  7. P. Seymour N. Robertson, D. Sanders and R. Thomas. The four colour problem, 1994.

    Google Scholar 

  8. Oystein Ore. The four-color problem. Academic Press, 1967.

    Google Scholar 

  9. Thomas L. Saaty and Paul. C. Kainen. The four-color problem, assaults and conquest. Mc Graw-Hill International Book Company, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRIN, Université de Nantes, 2, rue de la Houssinière, 44072, Nantes cedex, France

    Philippe Rolland

Authors
  1. Philippe Rolland
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michel Deza Reinhardt Euler Ioannis Manoussakis

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rolland, P. (1996). Four coloring for a subset of maximal planar graphs with minimum degree five. In: Deza, M., Euler, R., Manoussakis, I. (eds) Combinatorics and Computer Science. CCS 1995. Lecture Notes in Computer Science, vol 1120. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61576-8_68

Download citation

  • DOI: https://doi.org/10.1007/3-540-61576-8_68

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61576-7

  • Online ISBN: 978-3-540-70627-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation