Skip to main content
SpringerLink
Log in

Transformations for maximal planar graphs with minimum degree five

Short paper

  • Session 6B: Combinatorics
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1995)

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

Included in the following conference series:

  • 152 Accesses

Abstract

In this paper, we present some results on maximal planar graphs with minimum degree five, denoted by MPG5 graphs [4]. We describe a method to generate the MPG5 graphs with n fixed vertices. We prove that this proceed can produce all MPG5 graphs.

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. D. Avis. Generating rooted triangulations without repetitions. Technical Report SOCS-94.2, Mc Gill Montreal, 1994.

    Google Scholar 

  2. D. Avis and K. Fukuda. Reverse search for enumeration. Technical Report 92-5, University of Tsukuba, 1994.

    Google Scholar 

  3. G. Marble D.W.Matula and J.D. Isaacson. Graph coloring algorithms. In R. C. Read, Graph Theory and Computing, Academic Press, New York, pages 108–122, 1972.

    Google Scholar 

  4. 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 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Jean Hardouin Duparc & Philippe Rolland

Authors
  1. Jean Hardouin Duparc
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Rolland
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Ming Li

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Duparc, J.H., Rolland, P. (1995). Transformations for maximal planar graphs with minimum degree five. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030852

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60216-3

  • Online ISBN: 978-3-540-44733-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation