Skip to main content
SpringerLink
Log in

Graph Coloring

GC

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

See also

References

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 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Appel K, Haken W (1977) Every planar map is four colorable. Part 1: Discharging. Illinois J Math 21:429–490

    MathSciNet  MATH  Google Scholar 

  2. Appel K, Haken W (1977) Every planar map is four colorable. Part 2: Reducibility. Illinois J Math 21:491–567

    MathSciNet  MATH  Google Scholar 

  3. Balas E (1986) A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring. Discrete Appl Math 15:123–134

    Article  MathSciNet  MATH  Google Scholar 

  4. Balas E, Xue J (1991) Minimum weighted coloring of triangulated graphs with application to maximum weight vertex packing and clique finding in arbitrary graphs. SIAM J Comput 20:209–221

    Article  MathSciNet  MATH  Google Scholar 

  5. Balas E, Xue J (1996) Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring. Algorithmica 15:397–412

    Article  MathSciNet  MATH  Google Scholar 

  6. Brelaz D (1979) New methods to color vertices of a graph. Comm ACM 22:251–256

    Article  MathSciNet  MATH  Google Scholar 

  7. Brown JR (1972) Chromatic scheduling and the chromatic number problem. Managem Sci 19:456–463

    MATH  Google Scholar 

  8. Carraghan R, Pardalos PM (1990) An exact algorithm for the maximum clique problem. Oper Res Lett 9:375–382

    Article  MATH  Google Scholar 

  9. de Werra D (1985) An introduction to timetabling. Europ J Oper Res 19:151–162

    Article  MathSciNet  MATH  Google Scholar 

  10. de Werra D (1990) Heuristics for graph coloring. Computing 7:191–208

    MathSciNet  Google Scholar 

  11. de Werra D, Gay Y (1994) Chromatic scheduling and frequency assignment. Discrete Appl Math 49:165–174

    Article  MathSciNet  MATH  Google Scholar 

  12. Fiorini S, Wilson RJ (1977) Edge-coloring of graphs. Res Notes Math, vol 16. Pitman, Boston, MA

    Google Scholar 

  13. Garey MR, Johnson DS (1979) Computers and intractability: A guide to the theory of NP-completeness. Freeman, New York

    MATH  Google Scholar 

  14. Garey MR, Johnson DS, Stockmeyer I (1976) Some simplified NP-complete graph problems. Theoret Comput Sci 1:237–267

    Article  MathSciNet  MATH  Google Scholar 

  15. Gavril F (1972) Algorithms for coloring maximum clique: minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J Appl Math 1:181–187

    MathSciNet  Google Scholar 

  16. Gionfriddo M (1979) A short survey of some generalized colorings of graphs. Ars Combin 21:295–322

    MathSciNet  Google Scholar 

  17. Grötschel M, Lovász L, Schrijver A (1989) Polynomial algorithms for perfect graphs. Ann Discret Math 21:325–356

    Google Scholar 

  18. Halldórsson MM (1993) A still better performance guarantee for approximate graph coloring. Inform Process Lett 45:19–23

    Article  MathSciNet  MATH  Google Scholar 

  19. Hertz A (1990) A fast algorithm for coloring Meyniel graphs. J Combin Th B 50:231–240

    Article  MathSciNet  MATH  Google Scholar 

  20. Johnson DS (1974) Worst-case behavior of graph-coloring algorithms. In: Proc. 5th Southeastern Conf. Combinatorics: Graph Theory and Computing, Winnipeg, pp 513–528

    Google Scholar 

  21. Johnson DS, Trick M (eds) (1996) Cliques, coloring, and satisfiability: Second DIMACS implementation challenge. DIMACS. Amer. Math. Soc., Providence, RI

    MATH  Google Scholar 

  22. Karger D, Motwani R, Sudan M (1994) Approximate graph coloring by semidefinite programming. In: 35th Annual Symp. Foundations of Computer Sci., IEEE, New York, pp 2–13

    Google Scholar 

  23. Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of Computer Computations, Plenum, New York, pp 85–104

    Google Scholar 

  24. Kempe AB (1879) On the geographical problem of four colours. Amer J Math 2:193–200

    Article  MathSciNet  Google Scholar 

  25. Khanna S, Linial N, Safra S (1993) On the hardness of approximating the chromatic number. Proc. 2nd Israel Symp. Theory of Computing and Systems, IEEE, New York, pp 250–260

    Google Scholar 

  26. Korman SM (1979) The graph-colouring problem. In: Christofides N, Mingozzi A, Toth P, Sandi C (eds) Combinatorial Optimization. Wiley, New York, pp 211–235

    Google Scholar 

  27. Kubale M (1991) Graph coloring. In: Kent A, Williams JG (eds) Encycl. Microcomputers, vol 8. M. Dekker, New York, pp 47–69

    Google Scholar 

  28. Lee J, Leung J (1993) A comparison of two edge-coloring formulations. Oper Res Lett 13:215–223

    Article  MathSciNet  MATH  Google Scholar 

  29. Matula DW, Marble G, Isaacson D (1972) Graph coloring algorithms. In: Reed R (ed) Graph theory and computing. Academic Press, New York, pp 109–122

    Google Scholar 

  30. McDiarmid C, Sanchezarroyo A (1993) On total colorings of graphs. J Combin Th B 57:122–130

    Article  MATH  Google Scholar 

  31. Mehrotra A, Trick MA (1995) A column generation approach for graph coloring. Techn Report GSIA Carnegie-Mellon Univ

    Google Scholar 

  32. Nelson R, Wilson RJ (eds) (1990) Graph colorings. Longman, Harlow

    Google Scholar 

  33. Pardalos PM, Mavridou T, Xue J (1998) The graph coloring problem: A bibliographic survey. In: Du D-Z and Pardalos PM (eds) Handbook Combinatorial Optim, vol 2. Kluwer, Dordrecht, pp 331–395

    Google Scholar 

  34. Pardalos PM, Wolkowicz H (1994) Quadratic assignment and related problems. DIMACS. Amer. Math. Soc., Providence, RI

    MATH  Google Scholar 

  35. Pardalos PM, Xue J (1994) The maximum clique problem. J Global Optim 3:463–482

    Google Scholar 

  36. Rayward-Smith VJ, Osman IH, Reeves CR, Smith GD (eds) (1996) Modern heuristic search methods. Wiley, New York

    MATH  Google Scholar 

  37. Roberts FS (1995) From garbage to rainbows: generalizations of graph coloring and their applications. In: Alavi Y, Schwenk AJ (eds) Graph Theory, Combinatorics, and Algorithms, vol 2. Wiley, New York, pp 1031–1052

    Google Scholar 

  38. Saaty TL, Keinen PC (1977) The four-color problem. McGraw-Hill, New York

    MATH  Google Scholar 

  39. Schmidt G, Ströhleim T (1980) Timetable construction - an annotated bibliography. Comput J 23:307–316

    Article  Google Scholar 

  40. Stockmeyer L (1973) Planar 3-colorability is polynomial complete. ACM SIBACT News 5:19–25

    Article  Google Scholar 

  41. Xue J (1994) Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem. Networks 24:109–120

    Article  MathSciNet  MATH  Google Scholar 

  42. Xue J (1998) Solving the minimum weighted integer coloring problem. J Comput Optim Appl 11:53–64

    Article  MATH  Google Scholar 

  43. Xue J, Liu J A network flow based lower bound for the minimum weighted integer coloring problem. Inform Process Lett (to appear).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department Management Sci., City University Hong Kong, Kowloon, Hong Kong

    Jue Xue

Authors
  1. Jue Xue
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Xue, J. (2008). Graph Coloring . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_253

Download citation

Publish with us

Policies and ethics

Search

Navigation