Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Four Colouring the Vertices of the Triangulation of a Polygon Containing a Hole

  • Conference paper
  • First Online:
Computational Science and Its Applications — ICCSA 2003 (ICCSA 2003)

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

Included in the following conference series:

Abstract

A simple linear-time algorithm is presented for four-colouring the vertices of a triangulation of a polygon containing a single hole. The algorithm consists of reducing a triangulation by the removal of both polygon and hole ear vertices, if any, followed by the removal of colour-isolated vertices until a 3-coloured tessellation remains. The triangulation is then re-built, using at most four colours. The paper concludes by recognising the similarity between the colouring of triangulations of polygons containing a hole and the colouring of bipartite and permutation graphs.

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

Access this chapter

Log in via an institution

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. O’Rourke, J.: Computational Geometry in C, Cambridge University Press. Cambridge (1994)

    Google Scholar 

  2. Diestel, R.: Graph Theory. Electronic Edition, Springer-Verlag, New York (2000), http://www.math.uni-hamburg.de/home/diestel/books/graph.theory

    Google Scholar 

  3. Chartland, G. and Frechen, J. B.: On the Chromatic Number of Permutation Graphs. In: Harary, F. (ed.): Proof Techniques in Graph Theory, Proceedings of the Second Ann Arbor Graph Theory Conference, February 1968. Academic Press, New York (1969) 21–24

    Google Scholar 

  4. Robertson, N., Sanders, D. P., Seymour, P. D. and Thomas, R.: The Four Colour Theorem, J Combin Theory Ser, B70, 2–44 (1997)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Engineering and Physical Sciences, Heriot-Watt University, Edinburgh, EH14 4AS, Scotland

    Graham M. Seed, Raffaella Ocone & Xiaoyan Y. Yang

  2. School of Mathematical and Computing Sciences, Heriot-Watt University, Edinburgh, EH14 4AS, Scotland

    Douglas E. R. Clark

Authors
  1. Graham M. Seed
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Douglas E. R. Clark
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Raffaella Ocone
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xiaoyan Y. Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Army High Performance Computing Research Center, USA University of Minessota Department of Computer Science and Engineering, MN, 55455, USA

    Vipin Kumar

  2. Department of Computer Science, University of Calgary, Calgary, AB, T2N1N4, Canada

    Marina L. Gavrilova

  3. Heuchera Technologies Inc., 122 9251-8Yonge Street, Richmond Hill, ON, Canada, L4C 9T3

    Chih Jeng Kenneth Tan

  4. School of Computer Science, The Queen’s University of Belfast, Belfast, BT7 1NN, Northern Ireland UK

    Chih Jeng Kenneth Tan

  5. Département d’informatique et de recherche opérationelle Montréal, Université de Montréal, Québec, H3C 3J7, Canada

    Pierre L’Ecuyer

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Seed, G.M., Clark, D.E.R., Ocone, R., Yang, X.Y. (2003). Four Colouring the Vertices of the Triangulation of a Polygon Containing a Hole. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44842-X_91

Download citation

  • DOI: https://doi.org/10.1007/3-540-44842-X_91

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40156-8

  • Online ISBN: 978-3-540-44842-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation