Skip to main content
SpringerLink
Log in

An algorithm for colouring perfect planar graphs

  • Session 2 Graph Algorithms & Geometric Algorithms
  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1987)

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

Abstract

We present an algorithm to properly colour a perfect, planar graph G using λ(G) colours. This algorithm has time complexity O(n3/2) and is recursive, based on the Lipton-Tarjan Separator Algorithm.

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. C. BERGE, Sur une conjecture relative au problème des codes optimaux, Comm. 13ieme Assemblee Gen. URSI, Tokyo, 1962.

    Google Scholar 

  2. H. N. DJIDJEV, On the problem of partitioning planar graphs, SIAM J. Algebraic Discrete Methods 3 (1982), 229–240.

    Google Scholar 

  3. M. GOLUMBIC, "Algorithmic Graph Theory and Perfect Graphs", Academic Press, New York, 1980.

    Google Scholar 

  4. C. GRINSTEAD, "Toroidal Graphs and the Strong Perfect Graph Conjecture", Ph.D Thesis, UCLA, 1978.

    Google Scholar 

  5. M. GAREY, D. JOHNSON AND L. STOCKMEYER, Some simplified NP-complete graph problems, Theoretical Computer Science 1 (1976), 237–267.

    Article  Google Scholar 

  6. W. HSU, "How to Colour Claw-Free Perfect Graphs", Tech. Report #435, Cornell School of Operations Research and Industrial Eng., 1979.

    Google Scholar 

  7. R. LIPTON AND R. E. TARJAN, A separator theorem for planar graphs, SIAM J. Appl. Math. 36 (1979), 177–189.

    Article  Google Scholar 

  8. G. L. MILLER, Finding small simple cycle separators for 2-connected planar graphs, Sixteenth Symp. Theory of Comp. 1984, 376–382.

    Google Scholar 

  9. K. PARTHASARATHY AND G. RAVINDRA, The strong perfect graph conjecture is true for K1–3-free graphs, J. Combinatorial Theory Ser. B 21 (1976), 212–223.

    Google Scholar 

  10. A. TUCKER, Perfect graphs and an application to optimizing municipal services, SIAM Rev. 15 (1973), 585–590.

    Article  Google Scholar 

  11. A. TUCKER, The strong perfect graph conjecture for planar graphs, Canad. J. Math. 25 (1973), 103–114.

    Google Scholar 

  12. A. TUCKER, Critical perfect graphs and perfect 3-chromatic graphs, J. Combinatorial Theory Ser. B 23 (1977), 143–149.

    Article  Google Scholar 

  13. A. TUCKER AND D. WILSON, An O(N2) algorithm for colouring perfect planar graphs, Journal of Algorithms 5 (1984), 60–68.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Laboratory, University of Newcastle Upon Tyne, Claremont Tower, Claremont Road, NE1 7RU, Newcastle Upon Tyne, England

    Iain A. Stewart

Authors
  1. Iain A. Stewart
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kesav V. Nori

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stewart, I.A. (1987). An algorithm for colouring perfect planar graphs. In: Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1987. Lecture Notes in Computer Science, vol 287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18625-5_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-18625-5_42

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18625-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation