Skip to main content
SpringerLink
Log in

Applications of Graph Coloring

  • Conference paper
Computational Science and Its Applications – ICCSA 2005 (ICCSA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3482))

Included in the following conference series:

Abstract

A graph G is a mathematical structure consisting of two sets V(G) (vertices of G) and E(G) (edges of G). Proper coloring of a graph is an assignment of colors either to the vertices of the graphs, or to the edges, in such a way that adjacent vertices / edges are colored differently. This paper discusses coloring and operations on graphs with Mathematica and webMathematica. We consider many classes of graphs to color with applications. We draw any graph and also try to show whether it has an Eulerian and Hamiltonian cycles by using our package ColorG.

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

Access this chapter

Log in via an institution
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. Appel, K.I., Haken, W., Koch, J.: Every planar map is four colorable I: Discharing. Illinois J. Math (1977)

    Google Scholar 

  2. Birkhoff, G.D., Lewis, D.C.: Chromatic polinomials. Trans.Amer.Math.Soc. 60, 355–451 (1946)

    MATH  MathSciNet  Google Scholar 

  3. Bodlaender, H.L.: On the complexity of some coloring games. LNCS (1991)

    Google Scholar 

  4. Jonathan, G., Jay, Y.: Graph Theory and Its Applications. CRC Press, Boca Raton (1999)

    MATH  Google Scholar 

  5. Pemmaraju, S., Skiena, S.: Computational Discrete Mathematics. Cambridge Univ. Press, Cambridge (2003)

    MATH  Google Scholar 

  6. Skiena, S.: Implementing Discrete Mathematics-Combinatorics and Graph Theory with Mathematica. Addison-Wesley Publishing Company, Reading (1990)

    MATH  Google Scholar 

  7. Soaty, T.L., Kainen, P.C.: The four color problem. Dover, New York (1986)

    Google Scholar 

  8. Thulasiraman, K., Swamy, M.N.S.: Graphs: Theory and Algorithms. John Wiley and Sons, Inc., Chichester (1992)

    Google Scholar 

  9. Ufuktepe, U., Bacak, G., Beseri, T.: Graph Coloring with webMathematica. LNCS. Springer, Heidelberg (2003)

    Google Scholar 

  10. Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Discret. Analiz (1964)

    Google Scholar 

  11. Wickham, T.: webMathematica A User Guide. Wolfram Research, Inc. (2002)

    Google Scholar 

  12. Wolfram, S.: The Mathematica Book. Cambridge Univ. Press, Cambridge (1996)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Izmir Institute of Technology, Urla, Izmir, Turkey

    Ünal Ufuktepe & Goksen Bacak

Authors
  1. Ünal Ufuktepe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Goksen Bacak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering, Department University of Minnesota, USA

    Vipin Kumar

  4. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganà

  5. Institute of High Performance Computing, IHCP, 1 Science Park Road, 01-01 The Capricorn, Singapore Science Park II, 117528, Singapore

    Heow Pueh Lee

  6. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  7. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  8. OptimaNumerics Ltd, Belfast, United Kingdom

    Chih Jeng Kenneth Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ufuktepe, Ü., Bacak, G. (2005). Applications of Graph Coloring. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424857_55

Download citation

  • DOI: https://doi.org/10.1007/11424857_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25862-9

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation