Advertisement

The Graph Coloring Problem: A Bibliographic Survey

  • Panos M. Pardalos
  • Thelma Mavridou
  • Jue Xue
Chapter

Abstract

In this chapter G = (V,E) denotes an arbitrary undirected graph without loops, where V = {v 1, v 2,…, v n } is its vertex set and E = {e 1,e 2,…, e m } ⊂ (E ×E) is its edge set. Two edges are adjacent if they connect to a common vertex. Two vertices v i and v j are adjacent if there is an edge e = (v i ,v j ) ∈ E. Finally, if e = (v i ,v j ) ∈ E,we say e is incident to vertices v i , v j .

Keywords

Random Graph Chromatic Number Discrete Mathematic Graph Coloring Coloring Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    H.L. Abbott-HL and B. Zhou, The Star Chromatic Number of a Graph, Journal of Graph Theory 17 (1993), pp. 349–360.Google Scholar
  2. [2]
    Akers, Jr., and B. Sheldon, Fault Diagnosis as a Graph Coloring Problem, IEEE Transactions on Electronic Computers, C-23(4) (1974) pp. 706–712.Google Scholar
  3. [3]
    J. Akiyama and J. Urrutia, A Note on Balanced Colorings for Lattice Points, Discrete Mathematics, 83 (1990), pp 123–126.MATHMathSciNetGoogle Scholar
  4. [4]
    N. Alon and N. Kahale, A Spectral Technique for Coloring Random 3-Colorable Graphs, Proceedings of the twenty-sixth annual ACM symposium on the theory of computing, (1994) pp. 346–355.Google Scholar
  5. [5]
    N. Alon and M. Tarsi, A Note on Graph Coloring and Graph Polynomial, Journal of Combinatorial Theory Series B, 70(1) (1997) pp. 197–201MATHMathSciNetGoogle Scholar
  6. [6]
    B. Andrasfai, P. Erdös, and V.T. Sos, On the Connection Between Chromatic Number, Maximal Clique and Minimal Degree of a Graph, Discrete Math. (The Netherlands), 8 (1974) pp. 205–218.MATHMathSciNetGoogle Scholar
  7. [7]
    J.A. Andrews and M.S. Jacobson, On a Generalization of Chromatic Number and Two Kinds of Ramsey Numbers, Ars Combinatoria, 23 (1987) pp. 97–102MATHMathSciNetGoogle Scholar
  8. [8]
    J.A. Andrews and M.S. Jacobson, On a Generalization of Chromatic Number, Congressus Numerantium, 47 (1985) pp. 33–48.MathSciNetGoogle Scholar
  9. [9]
    K. Appel and W. Haken, Every Planar Map is Four Colorable: Part 1, Discharging, Illinois Journal of Mathematics, 21 (1977) pp. 429–490.MATHMathSciNetGoogle Scholar
  10. [10]
    K. Appel, W. Haken, and J. Koch, Every Planar Map is Four Colorable: Part 2, Reducibility, Illinois Journal of Mathematics, 21 (1977) pp. 491–567.MATHMathSciNetGoogle Scholar
  11. [11]
    J.S. Appleby, D.V. Blake, and E.A. Newman, Techniques for Producing School Timetables on a Computer and Their Application to Other Scheduling Problems, The Computer Journal, 3 (1961) pp. 237–245.MATHMathSciNetGoogle Scholar
  12. [12]
    D. Archdeacon, A Note on Defective Colorings of Graphs in Surfaces, J. Graph Theory, 11 (1987) pp. 517–519.MATHMathSciNetGoogle Scholar
  13. [13]
    E. Arjomandi, An efficient Algorithm for Colouring the Edges of a Graph with Δ+1 Colors, Technical Report, York University, Department of Computer Science, 1980.Google Scholar
  14. [14]
    S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems, Proc. 33rd IEEE Annual Sym. on Foundation of Computer Science, pp. 14–23, 1992.Google Scholar
  15. [15]
    S. Arora and S. Safra, Probabilistic Checking of Proofs; A New Characterization of NP, Proc. 33rd IEEE Annual Sym. on Foundation of Computer Science, (1992) pp. 1–13.Google Scholar
  16. [16]
    B. Aspvall and J.R. Gilbert, Graph Coloring using Eigenvalue Decomposition, SIAM Journal on Algebraic and Discrete Methods, 5(4) (1984) pp. 526–538.MATHMathSciNetGoogle Scholar
  17. [17]
    L. Avra, Allocation and Assignment in High-Level Synthesis for Self Testable Data Paths, Digest of Paare pers-International Test Conference, published by IEEE, (1992) pp. 463–472.Google Scholar
  18. [18]
    L. Babel and G. Tinhofer, Hard-to-Color Graphs for Connected Sequential Colorings, Discrete Applied Mathematics, 51(1–2) (1994) pp. 3–25.MATHMathSciNetGoogle Scholar
  19. [19]
    E. Balas, S. Ceria, G. Cornuejols, and G. Pataki, Polyhedral methods for the Maximum Clique Problem, in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Johnson and Trick (eds.), 26 (1996) pp. 11–28.Google Scholar
  20. [20]
    E. Balas and J. Xue, Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring, Algorithmica 15 (1996) pp. 397–412.MATHMathSciNetGoogle Scholar
  21. [21]
    E. Balas and J. Xue, Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs, SIAM J. Comput. Vol. 20, No. 2 (1991) pp. 209–221.MATHMathSciNetGoogle Scholar
  22. [22]
    P. Baldi, On a Generalized Family of Colorings, Graphs and Combinatorics, 6 (1990) pp. 95–110.MATHMathSciNetGoogle Scholar
  23. [23]
    P. Baldi and E.C. Posner, Graph Coloring Bounds for Cellular Radio, Computers and Mathematics with Applications, 19 (1990) pp. 91–97.MATHMathSciNetGoogle Scholar
  24. [24]
    J. Bang-Jensen and P. Hell, On the Effect of Two Cycles on the Complexity of Colouring, Discrete Applied Mathematics, 26 (1990) pp. 1–23.MATHMathSciNetGoogle Scholar
  25. [25]
    R. Bauernöppel and H. Jung, Fast Parallel Vertex Coloring, Fundamentals of Computation Theory, FCT ’85, eds. Lothar Budach, Cottbus, GDR, (1985) pp. 28–35Google Scholar
  26. [26]
    B. Bauslaugh, The Complexity of Infinite H-Coloring, Journal of Combinatorial Theory Series B, 61(2) (1994) pp. 141–154.MATHMathSciNetGoogle Scholar
  27. [27]
    I. Baybars, Optimal Assignment of Broadcasting Frequencies, European Journal of Operations Research, 9 (1982) pp. 257–263.MATHGoogle Scholar
  28. [28]
    M. Behzad, The Total Chromatic Number of a Graph, a Survey, in Combinatorial Mathematics and its Applications, (ed. D.J.A. Welsh), Academic Press, New York, (1971) pp. 1–8.Google Scholar
  29. [29]
    M. Behzad, Graphs and Their Chromatic Numbers, Ph.D. Thesis, Michigan State University, 1965.Google Scholar
  30. [30]
    E. Beltrami and L. Bodin, Networks and Vehicle Routing for Municipal Waste Collection, Networks, 4 (1973) pp. 65–94.Google Scholar
  31. [31]
    M. Bellare, and M. Sudan, Improved Non-approximability Results, Proc. Twenty sixth Ann. ACM Symp. on Theory of Comp., ACM (1994), pp. 184–193.Google Scholar
  32. [32]
    E.A. Bender and H.S. Wilf, A Theoretical Analysis of Backtracking in the Graph Coloring Problem, Journal of Algorithms, 6(2) (1985) pp. 275–282.MATHMathSciNetGoogle Scholar
  33. [33]
    C. Berge, Algorithms and Extremal Problems for Equipartite Colorings in Graphs and Hypergraphs, volume 2 of Annals of Discrete Mathematics, North- Holland Publishing Co. (1978) pp. 149–150.Google Scholar
  34. [34]
    C. Berge and P. Duchet, Strongly Perfect Graphs, Annals of Discrete Mathematics, 21 (1984) pp. 57–61.MathSciNetGoogle Scholar
  35. [35]
    B. Berger and J. Rompel, A Better Performance Guarantee for Approximate Graph Coloring, Algorithmica, 5(4) (1990) pp. 459–466.MATHMathSciNetGoogle Scholar
  36. [36]
    K.A. Berman and J.L. Paul, The Bounded Chromatic Number for Graphs of Genus-G, Journal of Combinatorial Theory Series B, 56 (1992) pp 183–196.MATHMathSciNetGoogle Scholar
  37. [37]
    C. Bernardi, On a Theorem about Vertex Colorings of Graphs, Discrete Math., 64 (1987) pp. 95–96.MATHMathSciNetGoogle Scholar
  38. [38]
    D. Bernstein, D.Q. Goldin, M.C. Golumbic, H. Krawczyk, Y. Mansour, I. Nahshon, and R.Y. Pinter, Spill Code Minimization Techniques for Optimizing Compilers, Proceedings of the ACM SIGPLAN ’89 Conference on Programming Language Design and Implementation, Sigplan Notices, 24(6) (1989) pp. 258–263.Google Scholar
  39. [39]
    N. Biggs, Some Heuristics for Graph Coloring, Graph Colorings, R. Nelson and R. Wilson (eds.), Pitman Research Notes in Mathematics Series, Wiley (1990) pp. 87–96Google Scholar
  40. [40]
    J.R. Bitner and E. Reingold, Backtrack Programming Techniques, Communications of the ACM, 18 (1975) pp. 651–656.MATHGoogle Scholar
  41. [41]
    A. Blum, New Approximation Algorithms for Graph-Coloring, Journal of the Association for Computing Machinery, 41(3), (1994) 470–516.MATHMathSciNetGoogle Scholar
  42. [42]
    A. Blum, Some Tools for Approximate 3-Coloring, in 31st Annual Symposium on Foundations of Computer Science, (1990) pp. 554–562.Google Scholar
  43. [43]
    A. Blum, An Õ(n 0.4)-Approximation Algorithm for 3-Coloring (and Improved Approximation Algorithms for k-Coloring), in Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, (1989) pp. 535–542.Google Scholar
  44. [44]
    A. Blum and J.H. Spencer, Coloring Random and Semi-random k-Colorable Graphs, Journal of Algorithms, 19 (1995), 204–234.MATHMathSciNetGoogle Scholar
  45. [45]
    L.D. Bodin and A.J. Friedman, Scheduling of Committees for the New York State Assembly, Technical Report USE No. 71–9, Urban Science and Engineering, State University of New York, Stony Brook, 1971.Google Scholar
  46. [46]
    B. Bollobás, The Chromatic Number of Random Graphs, Combinatorica, 8 (1988) pp. 49–55.MATHMathSciNetGoogle Scholar
  47. [47]
    B. Bollobás, Random Graphs, Academic Press, 1985.MATHGoogle Scholar
  48. [48]
    B. Bollobás, Chromatic Number, Girth, and Maximal Degree, Discrete Mathematics, 24 (1978) pp. 311–314.MATHMathSciNetGoogle Scholar
  49. [49]
    B. Bollobás and A.J. Harris, List Colourings of Graphs, Graphs and Combinatorics, 1 (1985) pp. 115–127.MATHMathSciNetGoogle Scholar
  50. [50]
    B. Bollobás and A. Thomason, Random Graphs of Small Order, in Random Graphs ’83, 28 of Annals of Discrete Mathematics, Section 6: “Colouring Large Random Graphs”. North-Holland Publishing Co., (1985) pp. 47–97.Google Scholar
  51. [51]
    J.A. Bondy, Bounds for the Chromatic Number of a Graph, Journal of Combinatorial Theory, 7 (1969) pp. 96–98.MATHMathSciNetGoogle Scholar
  52. [52]
    O.V. Borodin and A.V. Kostochka, On an Upper Bound of a Graph’s Chromatic Number, Depending on the Graph’s Degree and Density, J. Combinatorial Theory (B), 23 (1977) pp. 247–250.MATHMathSciNetGoogle Scholar
  53. [53]
    A.A. Borovikov and V.A. Gorbatov, A Criterion for Coloring of the Vertices of a Graph, Eng. Cybernetics, 10 (1972) pp. 683–686.MathSciNetGoogle Scholar
  54. [54]
    J.F. Boyar and H.J. Karloff, Coloring Planar Graphs in Parallel, Journal of Algorithms, 8 (1987) pp. 470–479.MATHMathSciNetGoogle Scholar
  55. [55]
    D. Brelaz, New Methods to Color Vertices of a Graph, Communications of the ACM, 22(4) (1979) pp. 251–256.MATHMathSciNetGoogle Scholar
  56. [56]
    R. Brewster, The Complexity of Coloring Symmetrical Relational Systems, Discrete Applied Mathematics, 49 (1994) pp. 95–105.MATHMathSciNetGoogle Scholar
  57. [57]
    P. Briggs, K.D. Cooper and L. Torczon, Improvements to Graph-Coloring Register Allocation, ACM Transactions on Programming Languages and Systems, 16(3) (1994) pp. 428–455.Google Scholar
  58. [58]
    P. Briggs, K. Cooper and L. Torczon, Coloring Register Pairs, ACM Letters Programming Language Systems, 1(1) (1992) pp. 3–13.Google Scholar
  59. [59]
    S. Broder, Final Examination Scheduling, Communications of the ACM, 7(8) (1964) pp. 494–498.MATHGoogle Scholar
  60. [60]
    H.J. Broersma and F. Gobel, Coloring a Graph Optimally with 2 Colors, Discrete Mathematics, 118 (1993) pp. 23–31.MATHMathSciNetGoogle Scholar
  61. [61]
    R.L. Brooks, On Coloring the Nodes of a Network, Mathematical Proceedings of the Cambridge Philosophical Society, 37 (1941) pp. 194–197.MathSciNetGoogle Scholar
  62. [62]
    J.I. Brown, The Complexity of Generalized Graph Colorings, Discrete Applied Mathematics, 69(3) (1996) pp. 257–270.MATHMathSciNetGoogle Scholar
  63. [63]
    J.R. Brown, Chromatic Scheduling and the Chromatic Number Problem, Management Science, Part I, 19(4) (1972) pp. 456–463.MATHGoogle Scholar
  64. [64]
    J.I. Brown, D. Kelly, J. Schönheim, and R.E. Woodrow, Graph Coloring Satisfying Restraints, Discrete Mathematics, 80(2) (1990) pp. 123–143.MATHMathSciNetGoogle Scholar
  65. [65]
    R.A. Brualdi and J.J.Q. Massey, Incidence and Strong Edge Colorings of Graphs, Discrete Mathematics, 122 (1993) pp. 51–58.MATHMathSciNetGoogle Scholar
  66. [66]
    E. Burattini, A. Massarotti, and A. Santaniello, A Graph Colouration Technique, In Second International Conference on Information Sciences and Systems (Univ. Patras, Patras, 1979), Vol. III, Reidel (1980) pp. 326–333.Google Scholar
  67. [67]
    L. Caccetta and N.J. Pullman, Regular Graphs with Prescribed Chromatic Number, Journal of Graph Theory, 14 (1990) pp. 65–71.MATHMathSciNetGoogle Scholar
  68. [68]
    L.Z. Cai and J.A. Ellis, Edge Coloring Line Graphs of Unicyclic Graphs, Discrete Applied Mathematics, 36 (1992) pp. 75–82.MATHMathSciNetGoogle Scholar
  69. [69]
    L. Cai and J.A. Ellis, NP-Completeness of Edge-Coloring Some Restricted Graphs, Discrete Applied Mathematics, 30 (1991) pp. 15–27.MATHMathSciNetGoogle Scholar
  70. [70]
    D. Callahan and B. Koblenz, Register Allocation via Hierarchical Graph Coloring, Proceedings of the ACM SIGPLAN ‘89 Conference on Programming Language Design and Implementation, Sigplan Notices, 26(6) (1991) pp. 192–203.Google Scholar
  71. [71]
    S.H. Cameron, The Solution of the Graph-coloring Problem as a Setcovering Problem, IEEE Trans. Elect. Magn. Comp., EMC-19 (1977) pp. 320–322.Google Scholar
  72. [72]
    J. Cameron and G. Thomas, An Approximate Graph Partitioning Algorithm and its Computational Complexity, Congress Numerantium, 49 (1985) pp. 287–293.MathSciNetGoogle Scholar
  73. [73]
    G. Campers, O. Henkes, and J.P. Leclercq, Graph Coloring Heuristics: A Survey, Some new Propositions and Computational Experiences on Random and “Leighton’s” Graphs, in Operations Research ’87 (Buenos Aires, 1987), North-Holland Publishing Co., 50 (1988) pp. 917–932.MathSciNetGoogle Scholar
  74. [74]
    G. Campers, O. Henkes, and J.P. Leclercq, Sur Les Methodes Exactes de Coloration de Graphes, On Exact Methods of Graph Coloring, Cahiers du Centre d’Etudes de Recherche Operationnelle, 29 (1987) pp. 19–30.MATHMathSciNetGoogle Scholar
  75. [75]
    M.C. Carlisle and E.L. Lloyd, On the K-Coloring of Intervals, Discrete Applied Mathematics, 59 (1995) pp. 225–235.MATHMathSciNetGoogle Scholar
  76. [76]
    J.D. Carpinelli and A.Y. Oruc, Applications of Matching and Edge-Coloring Algorithms to Routing in Close Networks, Networks, 24 (1994) pp. 319–326.MATHMathSciNetGoogle Scholar
  77. [77]
    Y. Caspi and E. Dekel, Edge-Coloring Series-Parallel Graphs, Journal of Algorithms, 18 (1995) pp. 296–321.MATHMathSciNetGoogle Scholar
  78. [78]
    P.A. Catlin, Homomorphisms as a Generalization of Graph Coloring, Congressus Numerantium, (1985) pp. 179–186.Google Scholar
  79. [79]
    P.A. Catlin, Another Bound on the Chromatic Number of a Graph, Discrete Math. (The Netherlands), 24 (1978) pp. 1–6.MATHMathSciNetGoogle Scholar
  80. [80]
    P.A. Catlin, A Bound on the Chromatic Number of a Graph, Discrete Math. (The Netherlands), 22 (1977) pp. 81–83.MathSciNetGoogle Scholar
  81. [81]
    G.J. Chaitin, Register Allocation and Spilling via Graph Coloring, in Proceedings of the ACM SIGPLAN 82 Symposium on Compiler Construction (Boston, June 1982). ACM, New York, (1982) pp. 98–105.Google Scholar
  82. [82]
    G.J. Chaitin, M.A. Auslander, A.K. Chandra, J. Cooke, M.E. Hopkins, and P. Markstein, Register Allocation via Coloring, Computer Languages, 6 (1981) pp. 47–57.Google Scholar
  83. [83]
    M. Chams, A. Hertz, and D. de Werra, Some Experiments with Simulated Annealing for Coloring Graphs, European Journal of Operational Research,32(2) (1987) pp. 260–266.MATHMathSciNetGoogle Scholar
  84. [84]
    G. Chartrand, D.P. Geller, and S. Hedetniemi, Graphs with Forbidden Subgraphs, J. Combinatorial Theory (B), 10 (1971) pp. 12–41.MATHMathSciNetGoogle Scholar
  85. [85]
    Y. I. Cheban, Investigation of a Generalized Graph Coloring Problem, In Investigation of Methods for Solving Extremal Problems (Russian),vii, Akad Nauk Ukrain. SSR, Inst. Kibernet Kiev (B) (1986) pp. 77–81.Google Scholar
  86. [86]
    P. Cheeseman, Kanefsky, and W. Taylor, Where the Really Hard Problems are, in International Joint Conference on Artificial Intelligence, (1991) pp. 331–337.Google Scholar
  87. [87]
    B.L. Chen and K.W. Lih, Equitable Coloring of Trees, Journal of Combinatorial Theory Series B, 61 (1994) pp. 83–97.MATHMathSciNetGoogle Scholar
  88. [88]
    G. Chen, R.H. Schelp and W.E. Shreve, A New Game Chromatic Number, European Journal of Combinatorics, 18 (1997) pp. 1–9.MATHMathSciNetGoogle Scholar
  89. [89]
    A. Chetwynd, Total Colourings of Graphs, Graph Colourings, R. Nelson and R.J. Wilson (eds.), Pitman Research Notes in Mathematics Series 218, John Wiley & Sons, New York, (1990) pp. 65–77Google Scholar
  90. [90]
    D. Chhajed, Edge-Coloring a k-Tree into 2 Smaller Trees, Networks, 29 (1997) pp. 191–194.MATHMathSciNetGoogle Scholar
  91. [91]
    M. Chorbak and M. Ślusarek, Problem 84–23, Journal of Algorithms, 5 (1984) pp. 588–588.Google Scholar
  92. [92]
    F. Chow and J. Hennessy, The Priority-Based Coloring Approach to Register Allocation, ACM Transactions on Programming Languages and Systems, 12(4) (1990) pp. 501–536.Google Scholar
  93. [93]
    F. Chow and J. Hennessy, Register Allocation by Priority-Based Coloring, in Proceedings of the ACM SIGPLAN 84 Symposium on Compiler Construction (Montreal, June 1984), ACM, New York, (1984) pp. 222–232.Google Scholar
  94. [94]
    N. Christofides, in Graph theory, An Algorithmic Approach, Academic Press, London, (1975) pp. 70–71.Google Scholar
  95. [95]
    N. Christofides, An Algorithm for the Chromatic Number of a Graph, Computing, 14 (1971) pp. 38–39.MATHMathSciNetGoogle Scholar
  96. [96]
    V. Chvátal, Perfectly Ordered Graphs, in C. Berge and V. Chvatal, editors, Topics on Perfect Graphs, Vol. 21 of Annals of Discrete Mathematics. North-Holland Publishing Co., (1984) pp. 63–65.Google Scholar
  97. [97]
    V. Chvátal, M.R. Garey, and D.S. Johnson, Two Results Concerning Multicoloring, in Aspects of Combinatorics Alspach et al. (eds), Vol 2 of Annals of Discrete Mathematics, North-Holland Publishing Co. (1978) pp. 151–154.Google Scholar
  98. [98]
    V. Chvátal, T. Hoang, N.V.R. Mahadev, and D. de Werra, Four Classes of Perfectly Orderable Graphs, Journal of Graph Theory, 11 (1987) pp. 481–495.MATHMathSciNetGoogle Scholar
  99. [99]
    A.J. Cole, The Preparation of Examination Time-Tables Using a Small Store Computer, The Computer Journal, 7 (1964) pp. 117–121.MATHGoogle Scholar
  100. [100]
    T.F. Coleman and J.J. More, Estimation of Sparse Hessian Matrices and Graph Coloring Problems, Mathematical Programming, 28 (1984) pp. 243–270.MATHMathSciNetGoogle Scholar
  101. [101]
    T.F. Coleman and J.J. More, Estimation of Sparse Jocobian Matrices and Graph Coloring Problems, SIAM Journal on Numerical Analysis, 20 (1983) pp. 187–209.MATHMathSciNetGoogle Scholar
  102. [102]
    R.J. Cook, Chromatic Number and Girth, Periodica Mathematica Hungarica, 6(1) (1975) pp. 103–107.MATHMathSciNetGoogle Scholar
  103. [103]
    R.J. Cook, Complementary Graphs and Total Chromatic Numbers, SIAM J. Appl. Math., 27 (1974) pp. 626–628.MATHMathSciNetGoogle Scholar
  104. [104]
    D.G. Corneil and B. Graham, An Algorithm for Determining the Chromatic Number of a Graph, SIAM Journal on Computing, 2(4) (1973) pp. 311–318.MATHMathSciNetGoogle Scholar
  105. [105]
    D. Costa and A. Hertz, Ants Can Colour Graphs, Journal of the Operational Society, 47 (1996) pp. 1–11.Google Scholar
  106. [106]
    D. Costa, A. Hertz, and O. Dubuis, Embedding a Sequential Procedure Within an Evolutionary Algorithm for Coloring Problems, Journal of Heuristics, 1 (1995) pp. 105–128.MATHGoogle Scholar
  107. [107]
    L.J. Cowen, R.H. Cowen, and D.R. Woodall, Defective Colorings of Graphs in Surfaces: Partitions into Subgraphs of Bounded Valency, J. Graph Theory, 10 (1986) pp. 187–195.MATHMathSciNetGoogle Scholar
  108. [108]
    M.B. Cozzens and F.S. Roberts, T-Colorings of Graphs and the Channel Assignment Problem, Congressus Numerantium, 35 (1982) pp. 191–208.MathSciNetGoogle Scholar
  109. [109]
    M.B. Cozzens and D.I. Wang, The General Channel Assignment Problem, Congressus Numerantium, 41 (1984) pp. 115–129.MathSciNetGoogle Scholar
  110. [110]
    J. Culberson, A. Beacham, and D. Papp, Hiding our Colors, in CP’95 Workshop on Studying and Solving Really Hard Problems, (1995) pp. 31–42.Google Scholar
  111. [111]
    J.C. Culberson, Iterated Greedy Graph Coloring and the Difficulty Landscape, Technical Report TR 92–07, University of Alberta Dept of Computer Science, Edmonton, Alberta Canada T6G 2H1, 1992, ftp: http://ftp.cs.ualberta.ca/pub/TechReports Google Scholar
  112. [112]
    J. C. Culberson and F. Luo, Exploring the k-colorable Landscape With Iterated Greedy, in Cliques, Coloring, and Satisfiability: Second DI-MACS Implementation Challenge, Johnson and Trick (eds.), 26 (1996) pp. 245–284.Google Scholar
  113. [113]
    A.R. Curtis, M.J.D. Powell, and J.K. Reid, On the Estimation of Sparse Jacobian Matrices, Journal Inst. Maths. Applications, 13 (1974) pp. 117–119.MATHGoogle Scholar
  114. [114]
    D.P. Dailey, Uniqueness of Colorability and Colorability of Planar 4-Regular Graphs are NP-Complete, Discrete Mathematics,30 (1980) pp. 289–293.MATHMathSciNetGoogle Scholar
  115. [115]
    D. de Werra, Heuristics for Graph Coloring, Computing, 7 (1990) pp. 191–208.Google Scholar
  116. [116]
    D. de Werra, An Introduction to Timetabling, European Journal of Operational Research, 19 (1985) pp. 151–162.MATHMathSciNetGoogle Scholar
  117. [117]
    D. de Werra, On a Particular Conference Scheduling Problem, INFOR—Canadian Journal of Operational Research and Information Processing, 13 (1975) pp. 308–315.MATHGoogle Scholar
  118. [118]
    D. de Werra, How to Color a Graph, in B. Roy (editor) Combinatorial Programming—Methods and Applications,NATO Advanced Science Institute Series C: Mathematical and Physical Sciences, 19 (1974) pp. 305–325.Google Scholar
  119. [119]
    D. de Werra, Some Results in Chromatic Scheduling, Z. Operations Res. Ser. A (1974) pp. 167–175.Google Scholar
  120. [120]
    D. de Werra and Y. Gay, Chromatic Scheduling and Frequency Assignment, Discrete Applied Mathematics, 49 (1994) pp. 165–174.MATHMathSciNetGoogle Scholar
  121. [121]
    D. de Werra and A. Hertz, Consecutive Colorings of Graphs, Zeitschrift für Operations Research, 32 (1988) pp. 1–8.MATHGoogle Scholar
  122. [122]
    P. Dencker, K. Dürre, and J. Heuft, Optimization of Parser Tables for Portable Compilers, ACM Transactions on Programming Languages and Systems, 6 (1984) pp. 546–572.Google Scholar
  123. [123]
    B. Descartes, Solution to Advanced Problem 4526, The American Mathematical Monthly, 61 (1954) pp. 352. proposed by P. Ungar; pseudonym for Tutte.MathSciNetGoogle Scholar
  124. [124]
    B. Descartes, A Three Colour Problem, Eureka, April 1947, solution march 1948, pseudonym for TutteeGoogle Scholar
  125. [125]
    K. Diks, A Fast Parallel Algorithm for Six-Colouring of Planar Graphs (extended abstract), in J. Gruska, B. Ruyan, and J. Wiedermann (editors) Mathematical Foundations of Computer Science 1986; Proceedings of the Twelfth Symposium Held in Bratislava, 233 of Lecture Notes in Computer Science, Springer-Verlag, (1986) pp. 273–282.Google Scholar
  126. [126]
    G.A. Dirac, The Structure of k-Chromatic Graphs, Fundamental Mathematicae, 40 (1953) pp. 42–55.MATHMathSciNetGoogle Scholar
  127. [127]
    K. Dowsland, Timetabling Problem in which Clashes are Inevitable, Journal of Operations Research Society, 41(10) (1990) pp. 907–918.Google Scholar
  128. [128]
    F.D.J. Dunstan, Sequential Colourings of Graphs, in Proceedings of Fifth British Combinatorial Conference, Utilitas Mathematica, (1976) pp. 151–158.Google Scholar
  129. [129]
    K. Dürre, An Algorithm for Coloring the Vertices of an Arbitrary Graph, in P. Deussen, editor, unknown, vol. 78 of Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, (1973) pp. 82–89.Google Scholar
  130. [130]
    K. Dürre, J. Heuft, and H. Muller, Worst and Best Case Behavior of an Approximate Graph Coloring Algorithm, in J.R. Muhlbacher and Carl Hansen Verlag, editors, Proc. 7th Conference on Graphtheoretic Concepts in Computer Science (Linz, Austria, June 15–17, 1981), Munich, (1982) pp. 339–348.Google Scholar
  131. [131]
    R.D. Dutton and R.C. Brigham, A New Graph Coloring Algorithm, The Computer Journal, 24(1) (1981) pp. 85–86.MATHMathSciNetGoogle Scholar
  132. [132]
    M.E. Dyer and A.M. Frieze, The Solution to some Random NP-Hard Problems in Polynomial Expected Time, Journal of Algorithms, 10 (1989) pp. 451–489.MATHMathSciNetGoogle Scholar
  133. [133]
    M.E. Dyer and A.M. Frieze, The Solution to some Random NP-Hard Problems, in 27th Annual Symposium on Foundations of Computer Science, (1986) pp. 331–336.Google Scholar
  134. [134]
    S. Early, Evaluating a Timetabling Algorithm Based on Graph Recolouring. Ph.D. thesis, University of Oxford, 1968, B. Phil. Diss.Google Scholar
  135. [135]
    K. Edwards and C. Mcdiarmid, The Complexity of Harmonious Coloring for Trees, Discrete Applied Mathematics, 57 (1995) pp. 133–144.MATHMathSciNetGoogle Scholar
  136. [136]
    R.W. Eglese and G.K. Rand, Conference Seminar Timetabling, J. Opl. Res. Soc., 38 (1987) pp. 591–698.Google Scholar
  137. [137]
    J.A. Ellis and P.M. Lepolesa, A Las Vegas Coloring Algorithm, The Computer Journal, 32(5) (1989) pp. 474–476.MATHMathSciNetGoogle Scholar
  138. [138]
    P. Erdös, Graph Theory and Probability, Canadian Journal of Mathematics, 11 (1959) pp. 34–38.MATHGoogle Scholar
  139. [139]
    M. Erne and P. Erdös, Clique Numbers of Graphs, Discrete Mathematics, 59(3) (1986) pp. 235–241.MATHMathSciNetGoogle Scholar
  140. [140]
    P. Erdös and D.J. Kleitman, On coloring graphs to maximize the proportion of multicolored k-edges, J. Combin. Theory, 5 (1968) pp. 164–169.MATHGoogle Scholar
  141. [141]
    P. Erdös and R.J. Wilson, On the Chromatic Index of Almost all Graphs, Journal of Combinatorial Theory Series B, 23 (1977) pp. 255–257.MATHMathSciNetGoogle Scholar
  142. [142]
    P. Erdös, A. Rubin, and H. Taylor, Choosability in Graphs, Congressus Numerantium, 26 (1979) pp. 125–157.Google Scholar
  143. [143]
    T. Etzion and S. Bitan, On the Chromatic Number, Colorings and Codes of the Johnson Graph, Discrete Applied Mathematics, 70 (1996) pp. 163–175.MATHMathSciNetGoogle Scholar
  144. [144]
    S. Even, A. Itai and A. Shamir, On the Complexity of Time-table and Multicommondity Flow Problems, SIAM J. Comput., 5 (1976) pp. 691–703.MATHMathSciNetGoogle Scholar
  145. [145]
    U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy, Approximating Clique is Almost NP-Complete, in 32nd Annual Symposium on Foundations of Computer Science, (1991) pp. 2–3.Google Scholar
  146. [146]
    T.A. Feo and M.G.C. Resende, Flight Scheduling and Maintenance Base Planning, Management Science, 35(12) (1989) pp. 1415–1432.Google Scholar
  147. [147]
    T.A. Feo, M.G.C. Resende, and S.H. Smith, A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set, Technical Report, ORP89–19, Operations Research Group, Mechanical Engineering Department, University of Texas at Austin.Google Scholar
  148. [148]
    W. Fernandez de la Vega, Random Graphs Almost Optimally Colorable in Polynomial Time, in Random Graphs ’83, Vol. 28 of Annals of Discrete Mathematics, North-Holland Publishing Co., (1985) pp. 311–317.Google Scholar
  149. [149]
    W. Fernandez de la Vega, On the Chromatic Number of Sparse Random Graphs, in B. Bollobás, editor, Graph Theory and Combinatorics, Proceedings Cambridge Combinatorial Conference in Honour of Paul Erdös, Academic Press (Inc) (1984) pp. 321–328.Google Scholar
  150. [150]
    S. Fiorini and R.J. Wilson, Edge-Colorings of Graphs, Lecture Notes in Mathematics, 6, (Pitman), 102–126 1977.Google Scholar
  151. [151]
    C. Fleurent and J. A. Ferland, Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability, in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Johnson and Trick (eds.), 26 (1996) pp. 619–652.Google Scholar
  152. [152]
    C. Fleurent and J. A. Ferland, Genetic and hybrid algorithms for graph coloring, Annals of Operations Research, to appear, 1995.Google Scholar
  153. [153]
    J.A. Formby, A Computer Procedure for Bounding the Chromatic Number of a Graph, in D.J.A. Welsh, editor, Combinatorial Mathematics and its Applications, Proceedings of a Conference in Oxford, Academic Press, Inc., (1969) pp. 111–114.Google Scholar
  154. [154]
    C.E. Foster and H.C. Grossman, An Empirical Investigation of the Haifa Register Allocation Technique in the GNU C Compiler, Proc. IEEE SOUTHEASTCON, 2 pp. 776–779.Google Scholar
  155. [155]
    M. Franklin and K.K. Saluja, Hypergraph Coloring and Reconfigured Ram Testing, IEEE transactions on Computers, 43 (1994) pp. 725–736.MATHGoogle Scholar
  156. [156]
    E.C. Freuder, A Sufficient Condition of Backtrack-Free Search, Journal of the ACM, 29(1) (1982) pp. 24–32.MATHMathSciNetGoogle Scholar
  157. [157]
    M. Frick and M.A. Henning, Various Results on Defective Colorings of Graphs, Research Report 93/90/(3), Department of Mathematics, Applied Mathematics and Astronomy, University of South Africa, Pretoria, 1990.Google Scholar
  158. [158]
    C. Friden, A. Hertz, and D. de Werra, STABULUS: A Technique for Finding Stable Sets in Large Graphs with Tabu Search, Computing, 42 (1989) pp. 35–44.MATHGoogle Scholar
  159. [159]
    A.M. Frieze, On the Independence Number of Random Graphs, Discrete Mathematics, 81 (1990) pp. 171–175.MATHMathSciNetGoogle Scholar
  160. [160]
    A.M. Frieze, Parallel Colouring of Random Graphs, in M. Karoński, J. Jaworski, and A. Rudiński, editors, Random Graphs ’87,John-Wiley & Sons, Inc., (1990) pp. 41–52.Google Scholar
  161. [161]
    Z. Füredi, J.R. Griggs, and D.J. Kleitman, Pair Labellings with Given Distance, Institute for Mathematics and its Applications, University of Minnesota, Minneapolis, MN.Google Scholar
  162. [162]
    M. Fürer and C.R. Subramanian, Coloring Random Graphs, in The Third Scandinavian Workshop on Algorithm Theory (SWAT ’82), (1992) pre-print.Google Scholar
  163. [163]
    H.N. Gabow and O. Kariv, Algorithms for Edge Coloring Bipartite Graphs and Multigraphs, SIAM Journal on Computing, 11(1) (1982) pp. 117–129.MATHMathSciNetGoogle Scholar
  164. [164]
    H.N. Gabow, Using Euler Partitions to Edge Coloring Bipartite Multigraphs, Inter. J. Comp. and Inf. Sci., 5 (1976) pp. 345–355.MATHMathSciNetGoogle Scholar
  165. [165]
    A. Gamst, Application of Graph Theoretical Methods to GSM Radio Network Planning, Proc. IEEE International Symposium on Circuits and Systems, 2 (1991) pp. 942–945.Google Scholar
  166. [166]
    A. Gamst, Some Lower Bounds for a Class of Frequency Assignment Problems, IEEE Transactions on Vehicular Technology, VT-35 (1986) pp. 8–14.Google Scholar
  167. [167]
    A. Gamst and K. Ralf, Computational Complexity of some Interference Graph Calculations, IEEE Transactions on Vehicular Technology, 39 (1990) pp. 140–149.Google Scholar
  168. [168]
    M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, 1979.Google Scholar
  169. [169]
    M.R. Garey and D.S. Johnson, The Complexity of Near-Optimal Graphs Coloring, Journal of the ACM, 23 (1976) pp. 43–49.MATHMathSciNetGoogle Scholar
  170. [170]
    M.R. Garey, D.S. Johnson, and I. Stockmeyer, Some Simplified NP-Complete Graph Problems, Theoretic Computer Science, 1 (1976) pp. 237–267.MATHMathSciNetGoogle Scholar
  171. [171]
    M.R. Garey and D.S. Johnson, On Salazar and Oakford, Communication of the ACM, 18 (1975) pp. 240–241.Google Scholar
  172. [172]
    F. Gavril, Algorithms for Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph, SIAM Journal on Applied Mathematics, 1(2) (1972) pp. 181–187.MathSciNetGoogle Scholar
  173. [173]
    J. A. George, Solution of Linear Systems of Equations: Direct Methods for Finite Element Problems, Sparse Matrix Techniques: Copenhagen 1976, V.A. Barker, ed., Lecture Notes in Mathematics, 572, Springer-Verlag, New York, (1977) pp. 79–91.Google Scholar
  174. [174]
    I.M. Gessel, A Coloring Problem, American Mathematical Monthly, Vol 98, Iss 6, pp 530–533, 1991.MATHMathSciNetGoogle Scholar
  175. [175]
    L.E. Gibbons, D.W. Hearn, P.M. Pardalos, and M. Ramana, A Continuous Characterization of the Maximaum Clique Problem, Math. of Oper. Res., 22 (1997) pp. 754–768.MATHMathSciNetGoogle Scholar
  176. [176]
    L.E. Gibbons, D.W. Hearn, and P.M. Pardalos, A Continuous Based Heuristic for the Maximum Clique Problem, in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Johnson and Trick (eds.), 26 (1996) pp. 103–124.Google Scholar
  177. [177]
    A. Gibbons and W. Rytter, Optimally Edge-Coloring Outerplanar Graphs Is in NC, Theoretical Computer Science, 71 (1990) pp 401–411.MATHMathSciNetGoogle Scholar
  178. [178]
    E.N. Gilbert, Unpublished Technical Memorandum, Bell Telephone Laboratories, Murray Hill, NJ, (1972).Google Scholar
  179. [179]
    M. Gionfriddo, A Short Survey of Some Generalized Colourings of Graphs, Ars Combinatorica, 21 (1979) pp. 295–322.MathSciNetGoogle Scholar
  180. [180]
    M. Gionfriddo and G. Lofaro, 2-Colorings in S(T, T (1, V)), Discrete Mathematics, 111 (1993) pp. 263–268.MATHMathSciNetGoogle Scholar
  181. [181]
    R.K. Gjertsen, M.T. Jones and P.E. Plassmann, Parallel Heuristics for Improved, Balanced Graph Colorings, Journal of Parallel and Distributed Computing, 37 (1996) 171–186.Google Scholar
  182. [182]
    F. Glover, Future Paths for Integer Programming and Links to Artificial Intelligence, Computers and Operations Research, 13 (1986) pp. 533–549.MATHMathSciNetGoogle Scholar
  183. [183]
    F. Glover, M. Parker, and J. Ryan, Coloring by tabu branch and bound, in Cliques, Coloring, and Satisfiability Second DIMACS Implementation Challenge, Johnson and Trick (eds.), 26 (1996) pp. 285–307.Google Scholar
  184. [184]
    S.W. Golomb and L.D. Baumert, Backtrack Programming, Journal of the ACM, 12 (1965) pp. 516–524.MATHMathSciNetGoogle Scholar
  185. [185]
    M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs,Academic Press, New York, (1980).MATHGoogle Scholar
  186. [186]
    M.C. Golumbic, The Complexity of Comparability Graph Recognition and Coloring, Computing (Austria), 18 (1977) pp. 199–208.MATHMathSciNetGoogle Scholar
  187. [187]
    T. Gonzalez, A Note on Open Shop Preemptive Schedules, IEEE Trans. Comput., C-28 (1979) pp. 782–786.Google Scholar
  188. [188]
    D.A. Grable and A. Panconesi, Nearly Optimal Distributed Edge-Coloring in O(log logN) Rounds, Random Structures & Algorithms, 10 (1997) 385–405.MATHMathSciNetGoogle Scholar
  189. [189]
    J.R. Griggs, Lower Bounds on the Independence Number in Terms of the Degrees, Journal of Combinatorial Theory Series B, 34 (1983) pp. 22–39.MATHMathSciNetGoogle Scholar
  190. [190]
    G.R. Grimmett and C.J.H. McDiarmid, On Colouring Random Graphs, Mathematical Proceedings of the Cambridge Philosophical Society, 77 (1975) pp. 313–324.MATHMathSciNetGoogle Scholar
  191. [191]
    M. Grötschel, L. Lovász and A. Schrijver, Polynomial Algorithms for Perfect Graphs, Annals of Discrete Mathematics, 21 (1989) pp. 325–356.Google Scholar
  192. [192]
    B. Grünbaum, A Problem in Graph Colouring, The American Mathematical Monthly,77 (1970) pp. 1088–1092.MathSciNetGoogle Scholar
  193. [193]
    D.R. Guichard, No-Hole k-Tuple (R+1)-Distant Colorings of Odd Cycles, Discrete Applied Mathematics, 64 (1996) pp. 87–92.MATHMathSciNetGoogle Scholar
  194. [194]
    D.R. Guichard, Acyclic Graph-Coloring and the Complexity of the Star Chromatic Number, Journal of Graph Theory, 17 (1993) pp. 129–134.MATHMathSciNetGoogle Scholar
  195. [195]
    R. Gupta, M.L. Soffa and D. Ombres, Efficient Register Allocation via Coloring Using Clique Separators, ACM Transactions on Programming Languages and Systems, 16 (1994) pp. 370–386.Google Scholar
  196. [196]
    W. Gutjahr, E. Welzl and G. Woeginger, Polynomial Graph-Colorings, Discrete Applied Mathematics, 35 (1992) pp. 29–45.MATHMathSciNetGoogle Scholar
  197. [197]
    A. Gyárfás, Problems from the World Surrounding Perfect Graphs, Research Report 177, Computer and Automation Institute Studies, (1985).Google Scholar
  198. [198]
    ] A. Gyárfás and J. Lehel, On-Line Coloring of p 5-Free Graphs, Combinatorica, 11 (1991) pp. 181–184.MATHMathSciNetGoogle Scholar
  199. [199]
    A. Gyárfás and J. Lehel, First Fit and On-line Chromatic Number of Families of Graphs, Ars Combinatoria, 29 B, 1990.Google Scholar
  200. [200]
    A. Gyárfás and J. Lehel, On-Line and First Fit Colorings of Graphs, Journal of Graph Theory, 12 (1988) pp. 217–227.MATHMathSciNetGoogle Scholar
  201. [201]
    Hacène Aït Haddadène and Frédéric Maffray, Coloring perfect degenerate graphs, Discrete Mathematics, 163 (1997) pp. 211–215.MATHMathSciNetGoogle Scholar
  202. [202]
    R. Häggkvist, P. Hell, D.J. Miller, and V. Neumann-Lara, On Multiplicative Graphs, and the Product Conjecture, Combinatorica, 8 (1988) pp. 63–74.MATHMathSciNetGoogle Scholar
  203. [203]
    W.K. Hale, Frequency Assignment: Theory and Applications, Proceedings of the IEEE, 68 (1980) pp. 1497–1514.Google Scholar
  204. [204]
    M. M. Halldórsson, Parallel and on-line graph coloring, Journal of Algorithms,23 (1997) pp. 265–280.MATHMathSciNetGoogle Scholar
  205. [205]
    M. M. Halldórsson, A Still Better Performance Guarantee for Approximate Graph Coloring, Information Processing Letters 45 (1993) pp. 1923.Google Scholar
  206. [206]
    M.M. Halldórsson and M. Szegedy, Lower Bounds for Online Graph-Coloring, Theoretic Computer Science,130 (1994) pp. 163–174.MATHGoogle Scholar
  207. [207]
    P. Hansen and M. Delattre, Complete-link Cluster Analysis by Graph Coloring, J. of the American Stat. Assoc., 73 (1978) pp. 397–403.Google Scholar
  208. [208]
    P. Hansen, A. Hertz and J. Kuplinsky, Bounded Vertex Colorings of Graphs, Discrete Mathematics,111 (1993) pp. 305–312.MATHMathSciNetGoogle Scholar
  209. [209]
    F. Harary, Conditional Colorability in Graphs, Graphs and Applications, John Wiley & Sons, New York, (1985).Google Scholar
  210. [210]
    R. Hassin and S. Lahav, Maximizing the number of unused colors in the vertex coloring problem, Information Processing Letters, 52 (1994) pp. 87–90.MATHMathSciNetGoogle Scholar
  211. [211]
    X. He, An Efficient Algorithm for Edge Coloring Planar Graphs with Delta-Colors, Theoretical Computer Science,74 (1990) pp. 299–312.MATHMathSciNetGoogle Scholar
  212. [212]
    P. Hell and D.G. Kirkpatrick, Scheduling, Matching, and Coloring, in Algebraic Methods in Graph Theory,Vol. I, II,Colloq. Math. Soc. Janos Bolyai, 25, North-Holland Publishing Co., (1981) pp. 273–279.Google Scholar
  213. [213]
    P. Hell and J. NeŠetřil, On the Complexity of H-coloring, Journal Comb. Theory, B48 (1990) pp. 92–110.Google Scholar
  214. [214]
    A. Hertz, A New Polynomial-Time Algorithm for the Maximum Weighted (χ(G) — 1)-Coloring Problem in Comparability-Graphs, Mathematical Systems Theory, 27 (1994) pp. 357–363.MATHMathSciNetGoogle Scholar
  215. [215]
    A. Hertz, Cosine: A new graph coloring algorithm, Operations Research Letters, 10 (1991) pp. 411–415.MATHMathSciNetGoogle Scholar
  216. [216]
    A. Hertz, A Fast Algorithm for Coloring Meyniel Graphs, J. of Combin. Theory (B), 50 (1990) pp. 231–240.MATHMathSciNetGoogle Scholar
  217. [217]
    A. Hertz and D. de Werra, Using Tabu Search Techniques for Graph Coloring, Computing, 39 (1987) pp. 345–351.MATHMathSciNetGoogle Scholar
  218. [218]
    A. Hertz, B. Jaumard and M.P. Dearagao, Local Optima Topology for the K-Coloring Problem, Discrete Applied Mathematics,49 (1994) pp. 257–280.MATHMathSciNetGoogle Scholar
  219. [219]
    A.J.W. Hilton, Recent Results on the Total Chromatic Number, Discrete Mathematics, 111 (1993) pp. 323–331.MATHMathSciNetGoogle Scholar
  220. [220]
    A.J.W. Hilton and H.R. Hind, The Total Chromatic Number of Graphs Having Large Maximum Degree, Discrete Mathematics, 117 (1993) pp. 127–140.MATHMathSciNetGoogle Scholar
  221. [221]
    A.J.W. Hilton, R. Rado, and S.H. Scott, A (< 5)-Color Theorem for Planar Graphs, Bull. London Math. Soc., 5. NCPY, (1973) pp. 302–306.MATHMathSciNetGoogle Scholar
  222. [222]
    A.J.W. Hilton and R.J. Wilson, Edge Colorings of Graphs: A Progress Report, in Graph Theory and its Applications East and West: Proceedings of the First China-USA International Graph Theory Conference, Vol. 576 of Annals of the New York Academy of Sciences, (1989) pp. 241–249.Google Scholar
  223. [223]
    H.R. Hind, An Upper Bound for the Total Chromatic Number of Dense Graphs, Journal of Graph Theory, 16 (1992) pp. 197–203.MATHMathSciNetGoogle Scholar
  224. [224]
    C.T. Hoang, Efficient Algorithms for Minimum Weighted Coloring of Some Classes of Perfect Graphs, Discrete Applied Mathematics, 55 (1994) pp. 133–143.MATHMathSciNetGoogle Scholar
  225. [225]
    C.T. Hoang, A Parallel Algorithm for Minimum Weighted Coloring of Triangulated Graphs, Theoretical Computer Science, 99 (1992) pp. 335–344.MATHMathSciNetGoogle Scholar
  226. [226]
    A.J. Hoffman, On Eigenvalues and Colorings of Graphs, in Graph Theory and Its Applications, Bernard Harris (ed.), Academic Press, New York, (1970) pp. 79–91.Google Scholar
  227. [227]
    F. Hoffmann and K. Kriegel, A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems, SIAM Journal on Discrete Mathematics, 9 (1996) pp. 210–224.MATHMathSciNetGoogle Scholar
  228. [228]
    P. Holgate, Majorants of the Chromatic Number of a Random Graph, J. Roy. Statist. Soc. Ser. B., 31 (1969) pp. 303–309.MATHMathSciNetGoogle Scholar
  229. [229]
    G. Hopkins and W. Staton, Graphs with Unique Maximum Independent Sets, Discrete Mathematics, 57 (1985) pp. 245–251.MATHMathSciNetGoogle Scholar
  230. [230]
    K. Hung and T. Yum, An Efficient Code Assignment Algorithm for Multihop Spread Spectrum Packet Radio Networks, IEEE Global Telecommunications Conference and Exhibition, 1 (1990) pp. 271–274.Google Scholar
  231. [231]
    J.P. Hutchinson, 3-Coloring Graphs Embedded on Surfaces with All Faces Even-Sided, Journal of Combinatorial Theory Series B, 65 (1995) pp. 139–155.MATHMathSciNetGoogle Scholar
  232. [232]
    S. Irani, Coloring Inductive Graphs On-Line, Algorithmica,11 (1994) pp. 53–72.MATHMathSciNetGoogle Scholar
  233. [233]
    S. Irani, Coloring Inductive Graphs On-Line, in 31st Annual Symposium on Foundations of Computer Science, (1990) pp. 470–479.Google Scholar
  234. [234]
    R.W. Irving, NP-Completeness of a Family of Graph-Coloring Problems, Discrete Applied Mathematics, 5 (1983) pp. 111–117.MATHMathSciNetGoogle Scholar
  235. [235]
    K. Jansen and P. Scheffler, Generalized Coloring for Tree-Like Graphs, Discrete Applied Mathematics,75 (1997) pp. 135–155.MATHMathSciNetGoogle Scholar
  236. [236]
    T. R. Jensen and B. Toft, Graph Coloring Problems, Wiley Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Inc., (1995).MATHGoogle Scholar
  237. [237]
    R. Jeurissen and W. Layton, Load Balancing by Graph-Coloring, an Algorithm, Computers and Mathematics with Applications, 27 (1994) pp. 27–32.MATHMathSciNetGoogle Scholar
  238. [238]
    G. Johns and F. Saba, On the Path-Chromatic Number of a Graph, in Graph Theory and its Applications East and West: Proceedings of the First China-USA International Graph Theory Conference, Vol. 576 of Annals of the New York Academy of Sciences, (1989) pp. 275–280.Google Scholar
  239. [239]
    D.S. Johnson, Approximation Algorithms for Combinatorial Problems, Journal of Computer and System Sciences, 9 (1974) pp. 256–278.MATHMathSciNetGoogle Scholar
  240. [240]
    D.S. Johnson, Worst-Case Behavior of Graph-Coloring Algorithms, in Proceedings of 5th Southeastern Conference on Combinatorics, Graph Theory and Computing, Winnipeg, (1974) pp. 513–528.Google Scholar
  241. [241]
    D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon, Optimization by Simulated Annealing: An Experimental Evaluation, part II, Graph Coloring and Number Partitioning, Operations Research, 39(3) (1991) pp. 378–406.MATHGoogle Scholar
  242. [242]
    D.S. Johnson, M. Yannakakis, and C.H. Papadimitriou, On Generating all Maximal Independent Sets, Information Processing Letters,27 (1988) pp. 119–123.MATHMathSciNetGoogle Scholar
  243. [243]
    A. Johri and D.W. Matula, Probabilistic Bounds and Heuristic Algorithms, Technical Report 82-CSE-06, Southern Methodist University, Department of Computer Science, (1982).Google Scholar
  244. [244]
    M.T. Jones and P.E. Plassmann, A Parallel Graph-Coloring Heuristic, SIAM Journal on Scientific Computing, 14 (1993) pp. 654–669.MATHMathSciNetGoogle Scholar
  245. [245]
    J. Kahn, Asymptotically Good List-Colorings, Journal of Combinatorial Theory Series A, 73 (1996) pp. 1–59.MATHMathSciNetGoogle Scholar
  246. [246]
    J. Kahn, Coloring Nearly-Disjoint Hypergraphs with N+o(N) Colors, Journal of Combinatorial Theory Series A, 59 (1992) pp. 31–39.MATHMathSciNetGoogle Scholar
  247. [247]
    A.A. Kamins, The Coloring of Graphs in a Linear Number of Steps, Cybern., 7 (1971) pp. 691–700.Google Scholar
  248. [248]
    V. Kann, On the Approximability of the Maximum Common Subgraph Problem, in STAGS 92, (1992) pp. 377–388.MathSciNetGoogle Scholar
  249. [249]
    D. Karger, R. Motwani, and M. Sudan, Approximate graph coloring by semidefinite programming, in 35th Annual Symposium on Foundations of Computer Science, IEEE (1994) pp. 2–13.Google Scholar
  250. [250]
    R.M. Karp, Reducibility Among Combinatorial Problems, in R.E. Miller and J.W. Thatcher, editors, Complexity of Computer Computations, Plennum Press, New York, NCPY, (1972) pp. 85–104.Google Scholar
  251. [251]
    R.M. Karp and D.W. Matula, Probabilistic Behaviour of a Naive Coloring Algorithm on Random Graphs, Bull. Oper. Res. Soc. Amer., 23 Suppl 2 (1975) pp. 264–264.Google Scholar
  252. [252]
    T. Kawaguchi, H. Nakano, and Y. Nakanishi, Probabilistic Analysis of a Heuristic Graph Coloring Algorithm, Electron. Corn. Japan, 65(6) (1982) pp. 12–18.MathSciNetGoogle Scholar
  253. [253]
    J.B. Kelly and L.M. Kelly, Paths and Circuits in Critical Graphs, American Journal of Mathematics, 76 (1954) pp. 786–792.MATHMathSciNetGoogle Scholar
  254. [254]
    S. Khanna, N. Linial and S. Safra, On the hardness of Approximating The Chromatic Number, To appear.Google Scholar
  255. [255]
    E.M. Kheifets, Planning of Operation of Communications Links in Packet Radio Networks Using a Graph-Coloring Algorithm, Automatic Control and Computer Sciences, 22(5) (1988) pp. 34–37.Google Scholar
  256. [256]
    S. Khuller, Coloring Algorithms for k5-Minor Free Graphs, Information Processing Letters, 34 (1990) pp. 203–208.MATHMathSciNetGoogle Scholar
  257. [257]
    S. Khuller, Extending Planar Graph Algorithms to k 3,3-Free Graphs, Information and Computation, 84(1) (1990) pp. 13–25.MATHMathSciNetGoogle Scholar
  258. [258]
    H.A. Kierstaed, S.G. Penrice and W.T. Trotter, Online and First-Fit Coloring of Graphs That Do Not Induce P 5, SIAM Journal on Discrete Mathematics, 8 (1995) pp. 485–485.MathSciNetGoogle Scholar
  259. [259]
    H.A. Kierstead, S.G. Penrice and W.T. Trotter, Online Coloring and Recursive Graph-Theory, SIAM Journal on Discrete Mathematics, 7 (1994) pp. 72–89.MATHMathSciNetGoogle Scholar
  260. [260]
    K. Kilakos and O. Marcotte, Fractional and Integral Colorings, Mathematical Programming, 76 (1997) pp. 333–347.MATHMathSciNetGoogle Scholar
  261. [261]
    S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi, Optimization by Simulated Annealing, Science, 220(4598) (1983) pp. 671–679.MATHMathSciNetGoogle Scholar
  262. [262]
    D. Klimowicz and M. Kubale, Graph Coloring by Tabu Search and Simulated Annealing, Archives of Control Sciences, 2(1–2) (1993) pp. 41–54.MATHMathSciNetGoogle Scholar
  263. [263]
    J.H. Kim, On 3-Colorings of E(Kn), Discrete Mathematics, 118 (1993) pp. 269–273.MATHMathSciNetGoogle Scholar
  264. [264]
    S. Kim and S.L. Kim, A 2-Phase Algorithm for Frequency Assignment in Cellular Mobile Systems, IEEE Transactions on Vehicular technology, 43 (1994) pp. 542–548.Google Scholar
  265. [265]
    P. Kolte and M.J. Harrold, Load/Store Range Analysis for Global Register Allocation, Proc. ACM SIGPLAN Conference on Programming Language Design Implementation, (1993) pp. 268–277.Google Scholar
  266. [266]
    D. König, Theorie der Endlichen and Unendlichen Graphen, Chelsea, New York, (1950).Google Scholar
  267. [267]
    A.A. Kooshesh and B.M.E. Moret, 3-Coloring the Vertices of a Triangulated Simple Polygon, Pattern Recognition, 25 (1992) pp. 443–443.Google Scholar
  268. [268]
    R.R. Korfhage and D.W. Matula, On S and O; More on the Salazar and Oakford Paper, Communications of the ACM, 18 (1975) pp. 240–240.Google Scholar
  269. [269]
    S.M. Korman, The Graph-Colouring Problem, in N. Christofides, A. Mingozzi, P. Toth, and C. Sandi, editors, Combinatorial Optimization, John Wiley & Sons, Inc., (1979) pp. 211–235.Google Scholar
  270. [270]
    A.D. Korshunov, The Chromatic Number of n- Vertex Graphs, Diskret. Analiz, 35 (in Russian), (1980) pp. 15–44.MATHGoogle Scholar
  271. [271]
    J. Korst, E. Aarts, J.K. Lenstra and J. Wessels, Periodic Assignment and Graph-Coloring, Discrete Applied Mathematics,51 (1994) pp. 291–305.MATHMathSciNetGoogle Scholar
  272. [272]
    V.P. Korzhik, A Lower-Bound for the One-Chromatic Number of a Surface, Journal of Combinatorial Theory Series B, 61 (1994) pp. 40–56.MATHMathSciNetGoogle Scholar
  273. [273]
    A.V. Kostochka, List Edge Chromatic Number of Graphs with Large Girth, Discrete Mathematics, 101 (1992) pp. 189–201.MATHMathSciNetGoogle Scholar
  274. [274]
    V. Kostochka, The Total Colouring of a Multigraph with Maximal Degree 4, Discrete math., 17 (1977) pp. 161–163.MATHMathSciNetGoogle Scholar
  275. [275]
    J. Kratochvil and Z. Tuza, Algorithmic Complexity of List Colorings, Discrete Applied Mathematics, 50 (1994) pp. 297–302.MATHMathSciNetGoogle Scholar
  276. [276]
    M. Kubale, Interval Edge-Coloring of a Graph with Forbidden Colors, Discrete Mathematics, 121 (1993) pp. 135–143.MATHMathSciNetGoogle Scholar
  277. [277]
    M. Kubale, Some Results Concerning the Complexity of Restricted Colorings of Graphs, Discrete Applied Mathematics,36 (1992) pp. 3546.MathSciNetGoogle Scholar
  278. [278]
    M. Kubale and J. Dabrowski, Empirical Comparison of Efficiency of Some Graph Colouring Algorithms, Arch. Autom. Telemech. (Poland), 23 (1978) pp. 129–139.MATHMathSciNetGoogle Scholar
  279. [279]
    M. Kubale and B. Jackowski, A Generalized Implicit Enumeration Algorithm for Graph Coloring, Communications of the ACM, 28(4) (1985) pp. 412–418.Google Scholar
  280. [280]
    M. Kubale and E. Kusz, Computer Experiences with Implicit Enumeration Algorithms for Graph Coloring, in M. Nagl and J. Perl, editors, International Workshop on Graph Theoretic Concepts in Computer Science. Proceedings of the WG ’83, Linz, Austria, 1983. Universitatisverlag Rudolf Trauner. GCL (ACM Guide to Computing Literature) ACM. (1983) pp. 167–176Google Scholar
  281. [281]
    L. Kučera, The greedy coloring is a bad probabilistic algorithm, Journal of Algorithms, 12 (1991) pp. 674–684.MATHMathSciNetGoogle Scholar
  282. [282]
    L. Kučera, Graphs With Small Chromatic Number are Easy to Color, Information Processing Letters, 30 (1989) pp. 233–236.MATHMathSciNetGoogle Scholar
  283. [283]
    L. Kučera, Expected Behavior of Graph Coloring Algorithms, in FCT ’77, Vol. 56 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, (1977) pp. 447–451.Google Scholar
  284. [284]
    K.R. Kumar, Al Kusiak and A. Vanelli, Grouping of Parts and Components in Flexible Manufacturing Systems, EJOR,24 (1986) pp. 387–397.Google Scholar
  285. [285]
    T.V. Lakshman, A. bagchi and K. Rastani, A Graph-Coloring Scheme for Scheduling Cell Transmissions and Its Photonic Implementation, IEEE Transactions on Communications, 42 (1994) pp. 2062–2070.Google Scholar
  286. [286]
    T.A. Lanfear, Graph Theory and Radio Assignment, Allied Radio Frequency Agency, NATO EMC Analysis Program, Project no. 5, (1989).Google Scholar
  287. [287]
    E.L. Lawler, A Note on the Complexity of the Chromatic Number Problem, Information Processing Letters, 5 (1976) pp. 66–67MATHMathSciNetGoogle Scholar
  288. [288]
    J. Lee and J. Leung, A Comparison of 2 Edge-Coloring Formulations, Operations Research Letters, 13 (1993) pp. 215–223.MATHMathSciNetGoogle Scholar
  289. [289]
    F.T. Leighton, A Graph Colouring Algorithm for Large Scheduling Problems, J. Res. Nat. Bur. Stand., 84 (1979) pp. 489–496.MATHMathSciNetGoogle Scholar
  290. [290]
    D.S.P. Leung, Application of the Partial Backtracking Technique to the Frequency Assignment Problem, IEEE International Symposium on Electromagnetic Compatibility,(1981) pp. 70–74.Google Scholar
  291. [291]
    G. Lewandowski and A. Condon, Experiments with parallel graph coloring heuristics and applications of graph coloring, in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Johnson and Trick (eds.), 26 (1996) pp. 309–334Google Scholar
  292. [292]
    W.F. Liang, X.J. Shen and Q. Hu, Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems, Journal of Parallel and Distributed Computing, 32 (1996) pp. 66–73.MATHGoogle Scholar
  293. [293]
    D.R. Lick and A.T. White, k-degenerate Graphs, Canad. J. Math., 22 (1970) pp. 1082–1096.MATHMathSciNetGoogle Scholar
  294. [294]
    V. Linek, Coloring Steiner Quadruple Systems, Journal of Combinatorial Theory Series A, 70 (1995) pp. 45–55.MATHMathSciNetGoogle Scholar
  295. [295]
    N. Linial and U. Vazirani, Graph Products and Chromatic Numbers, in 30th Annual Symposium on Foundations of Computer Science, (1989) pp. 124–128.Google Scholar
  296. [296]
    N. Linial, Graph Coloring and Monotone Functions for Posets, Discrete Mathematics, 58(1) (1986) pp. 97–98.MATHMathSciNetGoogle Scholar
  297. [297]
    D.D.F. Liu, T-Colorings of Graphs, Discrete Mathematics, 101 (1992) pp. 203–212.MATHMathSciNetGoogle Scholar
  298. [298]
    V. Lotfi and S. Sarin, A Graph Coloring Algorithm for Large Scale Scheduling Problems, Computers and Operations Research, 13(1) (1986) pp. 27–32.MATHMathSciNetGoogle Scholar
  299. [299]
    E. Loukakis, A New Backtracking Algorithm for Generating the Family of Maximal Independent Sets of a Graph, Computers and Mathematics with Applications,9 (1983) pp. 583–589.MATHMathSciNetGoogle Scholar
  300. [300]
    E. Loukakis and C. Tsouros, Determining the Number of Internal Stability of a Graph, International Journal of Computer Mathematics, 11 (1982) pp. 207–220.MATHMathSciNetGoogle Scholar
  301. [301]
    L. Lovász, Three Short Proofs in Graph Theory, J. Combinatorial Theory (B), 19 (1975) pp. 269–271.MATHGoogle Scholar
  302. [302]
    L. Lovász, On the Chromatic Number of Finite Set Systems, Acto. Math. Acad. Sci. Hungary, 19 (1968) pp. 59–67.MATHGoogle Scholar
  303. [303]
    L. Lovász, On Decomposition of Graphs, Studia Sci. Math. Hungar., 1 (1966) pp. 237–238.MATHMathSciNetGoogle Scholar
  304. [304]
    L. Lovász, M. Saks, and W.T. Trotter, An On-Line Graph Coloring Algorithm with Sublinear Performance Ratio, Discrete Mathematics, 75(13) (1989) pp. 319–325.MATHMathSciNetGoogle Scholar
  305. [305]
    Z.K. Lu, The Harmonious Chromatic Number of a Complete Binary and Trinary Tree, Discrete Mathematics,118 (1993) pp. 165–172.MATHMathSciNetGoogle Scholar
  306. [306]
    Z.K. Lu, On an Upper Bound for the Harmonious Chromatic Number of a Graph, Journal of Graph Theory, 15 (1991) pp. 345–347.Google Scholar
  307. [307]
    T. Luczak, The Chromatic Number of Random Graphs, Combinatorica, 11(1) (1991) pp. 45–54.MATHMathSciNetGoogle Scholar
  308. [308]
    T. Luczak, A Note on the Sharp Concentration of the Chromatic Number of Random Graphs, Combinatorica, 11(3) (1991) pp. 295–297.MATHMathSciNetGoogle Scholar
  309. [309]
    C. Lund and M. Yannakakis, On the Hardness of Approximating Minimization Problems, in Conference Proceedings of the Annual ACM Symposium on Theory of Computing,Publ. by ACM, New York, (1993) pp. 286–293.Google Scholar
  310. [310]
    V.H. MacDonald, Advanced Mobile Phone Service: The cellular concept, Bell Syst. Tech. J, 58 (1979) pp. 15–41.Google Scholar
  311. [311]
    N.V.R. Mahadev and F.S. Roberts, Amenable Colorings, Technical Report 92–26, DIMACS, Rutgers University, New Brunswick, NJ, (1992).Google Scholar
  312. [312]
    N.V.R. Mahadev, F.S. Roberts, and P. Santhanakrishnan, 3Choosable Complete Bipartite Graphs, Technical Report 91–62, DI-MACS, Rutgers University, New Brunswick, NJ, (1991).Google Scholar
  313. [313]
    B. Manvel, Extremely Greedy Coloring Algorithms, in Graphs and Applications (Boulder, CO,1982), John Wiley & Sons, Inc., New York, (1985) pp. 257–270.Google Scholar
  314. [314]
    B. Manvel, Coloring Large Graphs, in F. Harary and J.S. Maybee, editors, Proceedings of the 12th Southeastern Conference on Combinatorics,Graph Theory and Computing, (1981) pp. 197–204.Google Scholar
  315. [315]
    M.V. Marathe, H.B. Hunt and S.S. Ravi, Efficient Approximation Algorithms for Domatic Partition and Online Coloring of Circular Arc Graphs, Discrete Applied Mathematics, 64 (1996) pp. 135–149.MATHMathSciNetGoogle Scholar
  316. [316]
    D.W. Matula, Expose-and-Merge Exploration and the Chromatic Number of a Random Graph, Combinatorica, 7(3) (1987) pp. 275–284.MATHMathSciNetGoogle Scholar
  317. [317]
    D.W. Matula, Bounded Color Functions on Graphs, Networks, 2, NCPY. (1972) pp. 29–44.MATHMathSciNetGoogle Scholar
  318. [318]
    D.W. Matula, A Min-Max Theorem for Graphs with Application to Coloring, SIAM Review, 10 (1968) pp. 481–482.Google Scholar
  319. [319]
    D.W. Matula and L.L. Beck, Smallest-Last Ordering and Clustering and Graph Coloring Algorithms, Journal of the ACM, 30(3) (1983) pp. 417–427.MATHMathSciNetGoogle Scholar
  320. [320]
    D.W. Matula and L. Kučera, An Expose-and-Merge Algorithm and the Chromatic Number of a Random Graph, in M. Karoński, J. Jaworski, and A. Ruciiński, editors, Random Graphs ’87, John Wiley & Sons, Inc., (1990) pp. 175–187.Google Scholar
  321. [321]
    D.W. Matula, G. Marble, and J.D. Isaacson, Graph Coloring Algorithms, in Graph Theory and Computing, Academic Press, Inc., (1972) pp. 109–122.Google Scholar
  322. [322]
    H.A. Maurer, A. Salomaa, and D. Wood, Colorings and Interpretations: A Connection Between Graphs and Grammar Forms, Discrete Applied Mathematics, 3 (1981) pp. 119–135.MATHMathSciNetGoogle Scholar
  323. [323]
    S.T. McCormick, Optimal Approximation of Sparse Hessians and Its Equivalence to a Graph Coloring Problem, Mathematical Programming,26(2) (1983) pp. 153–171.MATHMathSciNetGoogle Scholar
  324. [324]
    C.J.H. McDiarmid, Colouring Random Graphs, Annals of Operations Research, 1 (1984) pp. 183–200.Google Scholar
  325. [325]
    C.J.H. McDiarmid, On the Chromatic Forcing Number of a Random Graph, Discrete Applied Mathematics, 5 (1983) pp. 123–132.MATHMathSciNetGoogle Scholar
  326. [326]
    C.J.H. McDiarmid, Achromatic Numbers of Random Graphs, Mathematical Proceedings of the Cambridge Philosophical Society, 92 (1982) pp. 21–28.MATHMathSciNetGoogle Scholar
  327. [327]
    C.J.H. McDiarmid, Colouring Random Graphs Badly, in Graph Theory and Combinatorics (Proc. Conf., Open Univ., Milton Keynes, 1978), Res. Notes in Mathematics 34, Pitman, San Francisco, (1979) pp. 76–86.Google Scholar
  328. [328]
    C.J.H. McDiarmid, Determining the Chromatic Number of a Graph, SIAM Journal on Computing, 8 (1979) pp. 1–14.MATHMathSciNetGoogle Scholar
  329. [329]
    C. Mcdiarmid and X.H. Luo, Upper-Bounds for Harmonious Colorings, Journal of Graph Theory, 15 (1991) pp. 629–636.MATHMathSciNetGoogle Scholar
  330. [330]
    C. Mcdiarmid and B. Reed, On Total Colorings of Graphs, Journal of Combinatorial Theory Series B,57 (1993) pp. 122–130.MATHMathSciNetGoogle Scholar
  331. [331]
    C.J.H. Mcdiarmid and A. Sanchezarroyo, An Upper Bound for Total Coloring of Graphs, Discrete Mathematics, 111 (1993) pp. 389–392.MATHMathSciNetGoogle Scholar
  332. [332]
    A. Mehrotra and M.A. Trick, A Column Generation Approach for Graph Coloring, Technical Report, GSAI, Carnegie Mellon University, Pittsburgh, PA, (1995).Google Scholar
  333. [333]
    N. Metropolis, A.W. Rosenbluth, A.H. Teller, and E. Teller, Equation of State Calculation by Fast Computing Machines, J. of Chem. Phys., 21 (1953) pp. 1087–1091.Google Scholar
  334. [334]
    B.H. Metzger, Spectrum Management Technique, Presented at 38th National ORSA Meeting Detroit Michigan, Fall 1970.Google Scholar
  335. [335]
    D.M. Miller, An Algorithm for Determining the Chromatic Number of a Graph, in Proceedings 5th Manitoba Conference on Numerical Math., (1975) pp. 533–548.Google Scholar
  336. [336]
    J. Mitchem, On Various Algorithms for Estimating the Chromatic Number of a Graph, The Computer Journal,19 (1976) pp. 182–183.MATHMathSciNetGoogle Scholar
  337. [337]
    C. Morgenstern, Distributed Coloration Neighborhood Search, in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Johnson and Trick (eds.), 26 (1996) pp. 335–358Google Scholar
  338. [338]
    C. Morgenstern, Improved Implementations of Dynamic Sequential Algorithms, Technical report, Texas Christian University, Fort Worth, Texas, (1991).Google Scholar
  339. [339]
    C. Morgenstern, Algorithms for General Graph Coloring, Technical report, University of New Mexico, Albuquerque, (1989).Google Scholar
  340. [340]
    C. Morgenstern and H. Shapiro, Improved Implementations of Dynamic Sequential Algorithms, Technical report, Texas Christian University, Fort Worth, Texas, (1991).Google Scholar
  341. [341]
    B.R. Myers and R. Liu, A Lower Bound on the Chromatic Number of a Graph, Networks, 1 (1972) pp. 273–277.MATHMathSciNetGoogle Scholar
  342. [342]
    R. Nelson and R.J. Wilson, editors, Graph Colorings. Pitman Research notes in Mathematics, Longman Scientific and Technical, 1990. A one day conference: survey papers.Google Scholar
  343. [343]
    G.A. Neufeld and J. Tartar, Generalized Graph Coloration, SIAM Journal on Applied Mathematics, 29 (1975) pp. 91–98.MATHMathSciNetGoogle Scholar
  344. [344]
    G.A. Neufeld and J. Tartar, Graph Coloring Conditions for the Existence of Solutions to the Timetable Problem, Communications of the ACM, 17 (1974) pp. 450–453.MATHMathSciNetGoogle Scholar
  345. [345]
    G.N. Newsam and J.D. Ramsdell, Estimation of Sparse Jacobian Matrices, SIAM Journal on Algebraic and Discrete Methods, 4(3) (1983) pp. 404–418.MATHMathSciNetGoogle Scholar
  346. [346]
    B.R. Nickerson, Graph Coloring Register Allocation for Processors with Mutiregister Operands, SIGPLAN Notices: ACM Special Interest Group on Programming Languages, 25(6) (1990) pp. 40–52.Google Scholar
  347. [347]
    U.J. Nieminen, A Viewpoint to the Minimum Coloring Problem of Hypergraphs, Kybernetika(Prague), 10 (1974) pp. 504–508.MATHMathSciNetGoogle Scholar
  348. [348]
    E. Nordhaus, E. and J. Gaddum, On Complementary Graphs Coloring, Amer. Math. Monthly, 63 (1956) pp. 175–177.MATHMathSciNetGoogle Scholar
  349. [349]
    S. Olariu and J. Randall, Welsh-Powell Opposition Graphs, Information Processing Letters, 31(1) (1989) pp. 43–46.MATHMathSciNetGoogle Scholar
  350. [350]
    R.J. Opsut, Optimization of Set Assignments for Graphs, Ph.D. Thesis, Dept. of Mathematics, Rutgers University, New Brunswick, NJ, (1984).Google Scholar
  351. [351]
    R.J. Opsut and F.S. Roberts, I-colorings, I-phasings, and I-intersection Assignments for Graphs, and their Applications, Networks, 13 (1983) pp. 327–345.MATHMathSciNetGoogle Scholar
  352. [352]
    R.J. Opsut and F.S. Roberts, On the Fleet Maintenance, Mobile Radio Frequency, Task Management, and Traffic Phasing Problems, in G. Chartrand, Y. Alavi, D.L. Goldsmith, L. Lesniak-Foster, and D.L. Lick, editors, The Theory and Applications of Graphs, Wiley, New York, (1981) pp. 479–492.Google Scholar
  353. [353]
    P.R.J. Ostergard, A Coloring Problem in Hamming-Spaces, European Journal of Combinatorics, 18 (1997) pp. 303–309.MathSciNetGoogle Scholar
  354. [354]
    A. Panconesi and A. Srinivasan, Randomized Distributed Edge-Coloring via an Extension of the Chernoff-Hoeffding Bounds, SIAM Journal of Computing, 26 (1997) pp. 350–368.MATHMathSciNetGoogle Scholar
  355. [355]
    A. Panconesi and A. Srinivasan, The Local Nature of 0-Coloring and Its Algorithmic Applications, Combinatorica, 15 (1995) pp. 255–280.MATHMathSciNetGoogle Scholar
  356. [356]
    A. Panconesi and A. Srinivasan, Improved Distributed Algorithms for Coloring and Network Decomposition Problems, in Proceedings of the 24th Annual ACM Symposium on Theory of Computing, (1992) pp. 581–592.Google Scholar
  357. [357]
    C.H. Papadimitriou and M. Yannakakis, Optimization, Approximation and Complexity Classes, in Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, (1988) pp. 229–234.Google Scholar
  358. [358]
    P.M. Pardalos and N. Desai, An Algorithm for Finding a Maximum Weighted Independent Set in an Arbitrary Graph, International Journal of Computer Mathematics, 38 (1991) pp. 163–175.MATHGoogle Scholar
  359. [359]
    P.M. Pardalos and A. Phillips, A Global Optimization Approach to Solving the Maximum Clique Problem, International Journal of Computer Mathematics, 33 (1990) pp. 209–216.MATHGoogle Scholar
  360. [360]
    P.M. Pardalos and G.P. Rodgers, A Branch and Bound Algorithm for the Maximum Clique Problem, Computers and Operations Research, 19(5) (1992) pp. 363–376.MATHGoogle Scholar
  361. [361]
    P.M. Pardalos and J. Xue, The Maximum Clique Problem. Journal of Global Optimization, 3 (1994) pp. 463–482.Google Scholar
  362. [362]
    P.M. Pardalos and H. Wolkowicz, Quadratic Assignment and Related Problems, DIMACS Series, American Mathematical Society, (1994).MATHGoogle Scholar
  363. [363]
    C. Payan, On the Chromatic Number of Cube-Like Graphs, Discrete Mathematics, 103 (1992) pp. 271–277.MATHMathSciNetGoogle Scholar
  364. [364]
    J. Peemöller, Numerical Experiences with Graph Coloring Algorithms, European Journal of Operations Research, 24(1) First EURO VI special issue, (1986) pp. 146–151.MATHGoogle Scholar
  365. [365]
    J. Peemöller, A Correction to Brélaz’s Modification of Brown’s Coloring Algorithm, Communications of the ACM, 26(8) (1983) pp. 595–597.Google Scholar
  366. [366]
    R.J. Pennotti and R.B. Boorstyn, Channel Assignment for Cellular Mobile Telecommunication Systems, Proc. NTC, (1976) pp. 16.5.1–16.5.5.Google Scholar
  367. [367]
    R.J. Pennotti, Channel Assignment in Cellular Mobile Telecommunication Systems, Ph.D. Dissertation Polytech. Inst. New York, (1976).Google Scholar
  368. [368]
    A.D. Petford and D.J. Welsh, A Randomized 3-Coloring Algorithm, Discrete Mathematics 74 (1989) pp. 253–261.MATHMathSciNetGoogle Scholar
  369. [369]
    S.S. Pinter, Register Allocation with Instruction Scheduling: A New Approach, ACM SIGPLAN Conference on Programming Language Design Implementation, (1993) pp. 1248–257.Google Scholar
  370. [370]
    B. Pittel and R.S. Weishaar, Online Coloring of Sparse Random Graphs and Random Trees, Journal of Algorithms, 23 (1997) pp. 195–205.MATHMathSciNetGoogle Scholar
  371. [371]
    C. Pommerell, M. Annaratone and W. Fichtner, A Set of New Mapping and Coloring Heuristics for Distributed-Memory Parallel Processors, SIAM Journal on Scientific and Statistical Computing, 13 (1992) pp. 194–226.MATHMathSciNetGoogle Scholar
  372. [372]
    J. Preater, A passage time for greedy-coloring cycles, Random Structures and Algorithms, 6 (1995) pp. 105–111.MATHMathSciNetGoogle Scholar
  373. [373]
    D. Rafaeli, D. Mahalel and J. Prashker, Heuristic Approach to Task Scheduling: ‘Weight’ and ‘Improve’ Algorithms, International Journal of Production Economics, 29(2) (1993) pp. 175–186.Google Scholar
  374. [374]
    P. Rajčáni, Optimal parallel 3-coloring algorithm for rooted trees and its applications, Information Processing Letters, 41 (1992) pp. 153–156.MATHGoogle Scholar
  375. [375]
    C.P. Ravikumar and R. Aggarwal, Parallel Search-and-Learn Techniques and Graph-Coloring, Knowledge-based Systems, 9 (1996) pp. 3–13.Google Scholar
  376. [376]
    A. Raychaudhuri, Further Results on T-Coloring and Frequency Assignment Problems, SIAM Journal on Discrete Mathematics, 7 (1994) pp. 605–613.MATHMathSciNetGoogle Scholar
  377. [377]
    A. Raychaudhuri, Optimal Multiple Interval Assignments in Frequency Assignment and Traffic Phasing, Discrete Applied Mathematics, 40 (1992) pp. 319–332.MATHMathSciNetGoogle Scholar
  378. [378]
    A. Raychaudhuri, Intersection Assignments, T-Colorings, and Powers of Graphs, Ph.D. thesis, Dept. of Mathematics, Rutgers University, New Brunswick, NJ, (1985).Google Scholar
  379. [379]
    A.A. Razborov, The Gap Between the Chromatic Number of a Graph and the Rank of Its Adjacency Matrix Is Superlinear, Discrete Mathematics, 108 (1992) pp. 393–396.MATHMathSciNetGoogle Scholar
  380. [380]
    C.R. Reeves, Modern Heuristic Techniques, Modern Heuristic Search Methods, Rayward-Smith, Osman, Reeves, and Smith (eds.), Wiley, (1996) pp. 1–26.Google Scholar
  381. [381]
    F.S. Roberts, New Directions in Graph Theory, in Que Vadis, Graph Theory? J. Gimbel, J.W. Kennedy, and L.V. Quintas, editors, Annals of Discrete Mathematics, 55 (1993) pp. 13–44.Google Scholar
  382. [382]
    F.S. Roberts, T-Colorings of Graphs: Recent Results and Open Problems, Discrete Mathematics, 93 (1991) pp. 229–245.MATHMathSciNetGoogle Scholar
  383. [383]
    F.S. Roberts, Set, T-, and List Colorings, in The First Workshop on Combinatorial Optimization in Science and Technology (COST), E. Boros and P.L. Hammer, editors, DIMACS/RUTCOR Tech. Rep. 3–91, Rutgers University, New Brunswick, NJ, (1991) pp. 290–297.Google Scholar
  384. [384]
    F.S. Roberts, From Garbage to Rainbows: Generalizations of Graph Coloring and their Applications, in Graph Theory, Combinatorics, and Applications, Vol. 2. Y. Alavi, G. Chartrand, O.R. Oellermann, and A.J. Schwenck, editors, Wiley, New York, (1991) pp. 1031–1052.Google Scholar
  385. [385]
    F.S. Roberts, Applied Combinatorics,Prentice-Hall, Englewood Cliffs, NJ, (1984).MATHGoogle Scholar
  386. [386]
    F.S. Roberts, On the Mobile Radio Frequency Assignment Problem and the Traffic Light Phasing Problem, Annals New York Acad. Sci.,319 (1979) pp. 466–483.Google Scholar
  387. [387]
    F.S. Roberts, Graph Theory and its Applications to Problems of Society. CBMS-NSF Monograph No.29, SIAM, Philadelphia, (1978).Google Scholar
  388. [388]
    F.S. Roberts, Discrete Mathematical Models, with Applications to Social, Biological, and Environmental Problems. Prentice-Hall, Englewood Cliffs, NJ, (1976).MATHGoogle Scholar
  389. [389]
    N. Robertson, P. Seymour and R. Thomas, Tutte’s Edge-Coloring Conjecture, Journal of Combinatorial Theory Series B, 70 (1997) pp. 166–183.MATHMathSciNetGoogle Scholar
  390. [390]
    N. Robertson, D. Sanders, P. Seymour and R. Thomas, The Four-Coloring Problem, Journal of Combinatorial Theory Series B, 70 (1997) pp. 2–44.MATHMathSciNetGoogle Scholar
  391. [391]
    J.M. Robson, An Estimate of the Store Size Necessary for Dynamic Storage Allocation, Journal of the ACM, 18 (1971) pp. 416–423.MATHMathSciNetGoogle Scholar
  392. [392]
    A. Rosa, On a Class of Computable Partial Edge-Colorings, Discrete Applied Mathematics, 35 (1992) pp. 293–299.MATHMathSciNetGoogle Scholar
  393. [393]
    S.I. Roschke and A.L. Furtado, An Algorithm for Obtaining the Chromatic Number and an Optimal Coloring of a Graph, Inf. Process. Lett. (The Netherlands), 2 (1973) pp. 34–38.MATHMathSciNetGoogle Scholar
  394. [394]
    D.J. Rose, A Graph-Theoretic Study of the Numerical Solution of Sparse Positive Definite System of Linear Equations, In Read, (1972) pp. 183–217Google Scholar
  395. [395]
    D.J. Rose, R.E. Tarjan, and G.S. Leuker, Algorithmic Aspects of Vertex Elimination on Graphs, SIAM J. Comput., 5 (1976) pp. 266–283.MATHMathSciNetGoogle Scholar
  396. [396]
    M. Rosenfeld, The Total Chromatic Number of Certain Graphs, Notices Amer. Math. Soc., 15 (1986) pp. 360–365.Google Scholar
  397. [397]
    M. Rosenfeld, On the Total Coloring of Certain Graphs, Israel J. Math., 9 (1971) pp. 396–402.MATHMathSciNetGoogle Scholar
  398. [398]
    R.L. Roth, Perfect Colorings of Multipatterns in the Plane, Discrete Mathematics, 122 (1993) pp. 269–286.MATHMathSciNetGoogle Scholar
  399. [399]
    T. Rus and S. Pemmaraju, Using Graph-Coloring in an Algebraic Compiler, ACTA Informatica, 34 (1997) pp. 191–209.MathSciNetGoogle Scholar
  400. [400]
    V. Rutenberg, Complexity of Generalized Graph Coloring, in J. Gruska, B. Rovan, and J. Wiedermann, editors, Mathematical Foundations of Computer Science 1986; Proceedings of the Twelfth Symposium Held in Bratislava,Vol. 233 of Lecture Notes in Computer science, Springer-Verlag (1986) pp. 537–581.Google Scholar
  401. [401]
    J. Ryan, The depth and width of local minima in discrete solution spaces, Discrete Applied Mathematics, 56 (1995) pp. 75–82.MATHMathSciNetGoogle Scholar
  402. [402]
    D. Sakai and C. Wang, No-Hole (R+1)-Distant Colorings, Discrete Mathematics, 119 (1993) pp. 175–189.MATHMathSciNetGoogle Scholar
  403. [403]
    T. Sakaki, K. Nakashima, and Y. Hattori, Algorithms for Finding in Lump Both Bounds of the Chromatic Number of a Graph, The Computer Journal, 19 (1976) pp. 329–332.MATHGoogle Scholar
  404. [404]
    A. Salazar and R.V. Oakford, A Graph Formulation of a School Scheduling Algorithm, Communications of the ACM, 18 (1974) pp. 241–242.MathSciNetGoogle Scholar
  405. [405]
    N.Z. Salvi, A Note on the Line-Distinguishing Chromatic Number and the Chromatic Index of a Graph, Journal of Graph Theory 17 (1993) pp. 589–591.MATHMathSciNetGoogle Scholar
  406. [406]
    S. Sensarma and B.K. Bandyopadhyay, Some Sequential Graph Colouring Algorithms, International Journal of Electronics,67(2) (1989) pp. 187–199.MathSciNetGoogle Scholar
  407. [407]
    L. Schiff, Traffic Capacity of Three Types of Common-User Mobile Radio Communication Systems, IEEE Transactions of Communications Technology,COMM-18 (1970) pp. 12–21.Google Scholar
  408. [408]
    G. Schmidt and T. Ströhleim, Timetable Construction — an Annotated Bibliography, The Computer Journal, 23 (1980) pp. 307–316.MathSciNetGoogle Scholar
  409. [409]
    T.B. Scott, Graph Colouring with Preassignment and Unavailability Constraints, Ars Combinatorica, 2 (1976) pp. 25–32.Google Scholar
  410. [410]
    M. Sengoku, On Telephone Traffic in a Mobile Radio Communication System using Dynamic Frequency Assignment, Trans. IECE Japan, E61 (1978) pp. 850–851.Google Scholar
  411. [411]
    M. Sengoku, H. Tamura, S. Shinoda and T. Abe, Graph and Network Theory and Cellular Mobile Communications, Proc. IEEE International Symposium on Circuits and Systems,4 (1993) pp. 2208–2211.Google Scholar
  412. [412]
    M. Sengoku, H. Tamura, S. Shinoda, T. Abe, and Y. Kajitani, Graph Theoretical Considerations of Channel Offset Systems in a Cellular Ma bile System, IEEE Transactions Vehicular Technology, 40(2) (1991) pp. 405–411.Google Scholar
  413. [413]
    S. Sensarma, R. Mandal and A. Seth, Some Sequential Graph-Coloring Algorithms for Restricted Channel Routing, International Journal of Electronics,77 (1994) pp. 81–93.Google Scholar
  414. [414]
    E. C. Sewell, An Improved Algorithm for Exact Coloring, in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Johnson and Trick (eds.), 26 (1996) pp. 359–373.Google Scholar
  415. [415]
    E. Shamir and J. Spencer, Sharp Concentration of the Chromatic Number of Random Graphs G n,p, Combinatorica, 7 (1987) pp. 121–129.MATHMathSciNetGoogle Scholar
  416. [416]
    E. Shamir and E. Upfal, Sequential and Distributed Graph Coloring Algorithms with Performance Analysis in Random Graph Spaces, Journal of Algorithms, 5(4) (1984) pp. 488–501.MATHMathSciNetGoogle Scholar
  417. [417]
    S. Shuller and V.V. Vazirani, Planar Graph Coloring is not Self-Reducible Assuming P Not Equal to NP, Technical Report 89–1064, Cornell University, Dept. of Computer Science, 1989. Subfile: STR (Stanford Technical Report).Google Scholar
  418. [418]
    G.J. Simmons, The Chromatic Number of Planar Graphs, in F. Harary and J.S. Maybee, editors, Graphs and Applications: Proceedings of the First Colorado Symposium on Graph Theory,John Wiley & Sons, Inc., (1985) pp. 295–316.Google Scholar
  419. [419]
    H. Simon, On Approximate Solutions for Combinatorial Optimization Problems, SIAM Journal on Discrete Mathematics,3(2) (1990) pp. 294–310.MATHMathSciNetGoogle Scholar
  420. [420]
    F.W. Sinden, Coloring Drawings of Bipartite Graphs - A Problem in Automated Assembly, Discrete Applied Mathematics, 41 (1993) pp. 55–68.MATHMathSciNetGoogle Scholar
  421. [421]
    D.H. Smith, Graph Coloring and Frequency Assignment, Ars Combinatorica, 25c (1988) pp. 205–212.Google Scholar
  422. [422]
    A. Soifer, A 6-Coloring of the Plane, Journal of Combinatorial Theory Series A, 61 (1992) pp. 292–294.MATHMathSciNetGoogle Scholar
  423. [423]
    D. Springer and D. E. Thomas, New methods for coloring and clique partitioning in data path allocation, Integration, 12 (1991) pp. 267–292.Google Scholar
  424. [424]
    J.P. Spinrad and G. Vijayan, Worst Case Analysis of a Graph Coloring Algorithm, Discrete Applied Mathematics,12(1) (1985) pp. 89–92.MATHMathSciNetGoogle Scholar
  425. [425]
    P.K. Srimani, B.P. Sinha, and A.K. Choudhury, A New Method to Find Out the Chromatic Partition of a Symmetric Graph, Int. J. Syst. Sci.,9 (1978) pp. 1425–1437.MATHMathSciNetGoogle Scholar
  426. [426]
    S. Stahl, n-tuple Colorings and Associated Graphs, Journal of Combinatorial Theory, 20 (1976) pp. 185–203.MATHMathSciNetGoogle Scholar
  427. [427]
    K. Stecke, Design Planning, Scheduling and Control Problems of Flexible Manufacturing Problems, Annals of Oper. Res.,3 (1985) pp. 3–12Google Scholar
  428. [428]
    M. Stiebitz, Subgraphs of Colour-critical Graphs, Combinatorica, 7 (1987) pp. 303–312.MATHMathSciNetGoogle Scholar
  429. [429]
    L. Stockmeyer, Planar 3-Colorability is Polynomial Complete, ACM SIBACT News,5(3) NCPY. (1973) pp. 19–25.Google Scholar
  430. [430]
    K.E. Stoffers, Scheduling Traffic Lights-A New Approach, Transportation Res., 2 (1968) pp. 199–234.Google Scholar
  431. [431]
    G. Stoyan and R. Stoyan, Coloring the Discretization Graphs Arising in the Multigrid Method, Computers & Mathematics with Applications, 22 (1991) pp. 55–62.MATHMathSciNetGoogle Scholar
  432. [432]
    D.P. Sumner, Subtrees of a Graph and the Chromatic Number, in: Theory and Applications of Graphs, ed., Chartrand, (1981) pp. 557–576.Google Scholar
  433. [433]
    L. Sun, A note on Coloring of Complete Graphs, Quarterly Journal of Mathematics, 46 (1995) pp. 235–237.MATHGoogle Scholar
  434. [434]
    S. Sur and P.K. Srimani, A Self-Stabilizing Algorithm for Coloring Bipartite Graphs, INFORMATION SCIENCES 69 (1993) pp. 219–227.MATHMathSciNetGoogle Scholar
  435. [435]
    M.M. Syslo, N. Deo, and J.S. Kowalik, Discrete Optimization Algorithms with PASCAL Programs, Prentice-Hall, Englewood, NJ, (1983).MATHGoogle Scholar
  436. [436]
    G. Szekeres and H.S. Wilf, An Inequality for the Chromatic Number of a Graph, Journal of Combinatorial Theory,4 (1968) pp. 1–3.MathSciNetGoogle Scholar
  437. [437]
    Y. Takefuji and K.C. Lee, Artificial Neural Networks for 4-Coloring Map Problems and K-Colorability Problems, IEEE Transactions on Circuits and Systems, 38 (1991) pp. 326–333.Google Scholar
  438. [438]
    Y. Takefuji and K.C. Lee, Parallel Algorithms for Finding a Near-Maximum Independent Set of a Circle Graph - Reply, IEEE Transactions on Neural Networks, 2 (1991) pp. 329–329.Google Scholar
  439. [439]
    T.K. Tan and J.K. Pollard, Determination of Minimum Number of Wavelengths Required for All-Optical WDM Networks Using Graph-Coloring, Electronics Letters, 31 (1995) pp. 1895–1897.Google Scholar
  440. [440]
    R.E. Tarjan, Decomposition by Clique Separators, Discrete Mathematics, 55(2) (1985) pp. 221–232.MATHMathSciNetGoogle Scholar
  441. [441]
    R.E. Tarjan and A.E. Trojanowski, Finding a Maximum Independent Set, SIAM Journal on Applied Mathematics, 6(3) (1977) pp. 537–546.MATHMathSciNetGoogle Scholar
  442. [442]
    M. Tateishi and S. Tamura, Artificial Neural Networks for 4-Coloring Map Problems and K-Colorability Problems, IEEE Transactions on Circuits and Systems I-Fundamental Theory and Applications, 41 (1994) pp. 248–249.Google Scholar
  443. [443]
    B.A. Tesman, List T-colorings of Graphs, Discrete Applied Mathematics, 45 (1993) pp. 277–289.MATHMathSciNetGoogle Scholar
  444. [444]
    J. Thepot and G. Lechenault, A Note on the Application of Hierarchical Clustering to Graph Coloring, RAIRO Rech. Oper., 15(1) (1981) pp. 73–83.MATHGoogle Scholar
  445. [445]
    C. Thomassen, 3-List-Coloring Planar Graphs of Girth-5, Journal of Combinatorial Theory Series B, 64 (1995) pp. 101–107.MATHMathSciNetGoogle Scholar
  446. [446]
    C. Thomassen, 5-Coloring Graphs on the Torus, Journal of Combinatorial Theory Series B,62 (1994) pp. 11–33.MATHMathSciNetGoogle Scholar
  447. [447]
    C. Thomassen, 5-Coloring Maps on Surfaces, Journal of Combinatorial Theory Series B, 59 (1993) pp. 89–105.MATHMathSciNetGoogle Scholar
  448. [448]
    B. Toft, Colouring, Stable Sets and Perfect Graphs, in Handbook of Combinatorics (R.L. Graham et al Editors), Elsevier (1995) pp. 223–288.Google Scholar
  449. [449]
    B. Toft, Color-critical Graphs and Hypergraphs, J. Combinat. Theory B, 16 (1974) pp. 145–161.MATHMathSciNetGoogle Scholar
  450. [450]
    B. Toft, On Critical Subgraphs of Colour-critical graphs, Discrete Math.,7 (1974) pp. 377–392.MATHMathSciNetGoogle Scholar
  451. [451]
    B. Toft, On the Maximal Number of Edges of Critical k-chromatic Graphs, Studia Sci. Math. Hungar., 5 (1970) pp. 461–470.MathSciNetGoogle Scholar
  452. [452]
    I. Tomescu, An Algorithm for Determining the Chromatic Number of a Finite Graph, Econ. Comput. Cybern. Stud. Res. (Rumania), 1 (1969) pp. 69–81.MathSciNetGoogle Scholar
  453. [453]
    I. Tomescu, Sur Le Problème du Coloriage des Graphes Généralisés, C. R. Acad. Sci. Paris Ser. A, 267 (1968) pp. 250–252.MATHMathSciNetGoogle Scholar
  454. [454]
    J. Topp and L. Volkmann, Some Upper-Bounds for the Product of the Domination Number and the Chromatic Number of a Graph, Discrete Mathematics, 118 (1993) pp. 289–292.MATHMathSciNetGoogle Scholar
  455. [455]
    W.T. Trotter and F. Harary, On Double and Multiple Interval Graphs, Journal of Graph Theory, 3 (1979) pp. 205–211.MATHMathSciNetGoogle Scholar
  456. [456]
    D.S. Troxell, No-Hole k-Tuple (R+1)-Distant Colorings, Discrete Applied Mathematics, 64 (1996) pp. 67–85.MATHMathSciNetGoogle Scholar
  457. [457]
    M. Truszczynski, Generalized Local Colorings of Graphs, Journal of Combinatorial Theory Series B, 54 (1992) pp. 178–188.MATHMathSciNetGoogle Scholar
  458. [458]
    P. Turan, On the Theory of Graphs, Colloq. Math., 3 (1954) pp. 19–30.MATHMathSciNetGoogle Scholar
  459. [459]
    J.S. Turner, Almost All k-Colorable Graphs are Easy to Color, Journal of Algorithms, 99 (1988) pp. 63–82.Google Scholar
  460. [460]
    J.S. Turner, On the Probable Performance of Graph Colouring Algorithms, Technical Report WUCS-85–7, (Washington University, Dept. of Computer Science, 1985. Subfile: STR (Stanford Technical Reports).Google Scholar
  461. [461]
    J.S. Turner, Point Symmetric Graphs with a Prime Number of Points, Journal of Combinatorial Theory,3 (1967) pp. 136–145.MATHGoogle Scholar
  462. [462]
    A. Tucker, Coloring a Family of Circular Arcs, SIAM J. Appl. Math., 29 (1975) pp. 493–502.MATHMathSciNetGoogle Scholar
  463. [463]
    A.C. Tucker, Perfect Graphs and an Application to Optimizing Municipal Services, SIAM Rev., 15 (1973) pp. 585–590.MATHMathSciNetGoogle Scholar
  464. [464]
    Z. Tuza, Graph-Coloring in Linear Time, Journal of Combinatorial Theory Series B, 55 (1992) pp. 236–243.MATHMathSciNetGoogle Scholar
  465. [465]
    R. Venkatesan and L.A. Levin, Random Instances of a Graph Coloring Problem are Hard, in Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, (1988) pp. 217–222.Google Scholar
  466. [466]
    N. Vijayaditya, On Total Chromatic Number of a Graph, J. London Math. Soc., 3 (1971) pp. 405–408.MATHMathSciNetGoogle Scholar
  467. [467]
    S. Vishwanathan, Randomized Online Graph Coloring, Journal of Algorithms, 13 (1992) pp. 657–669.MATHMathSciNetGoogle Scholar
  468. [468]
    S. Vishwanathan, Randomized Online Graph Coloring, in 31st Annual Symposium on Foundations of Computer Science, (1990) pp. 464–469.Google Scholar
  469. [469]
    N.G. Vizing, Some Unsolved Problems in Graph Theory, Russian Math. Surveys, 23 (1968) pp. 125–141.MATHMathSciNetGoogle Scholar
  470. [470]
    N.G. Vizing, The Chromatic Class of a Multigraph, Cybernetics (Russian), 3 (1965) pp. 32–41.Google Scholar
  471. [471]
    M. Voigt, List Colorings of Planar Graphs, Discrete Mathematics 120 (1993) pp. 215–219.MATHMathSciNetGoogle Scholar
  472. [472]
    M. Voigt and H. Walther, Chromatic Number of Prime Distance Graphs, Discrete Applied Mathematics, 51 (1994) pp. 197–209.MATHMathSciNetGoogle Scholar
  473. [473]
    S. Wagon, A Bound on the Chromatic Number of Graphs Without Certain Induced Subgraphs, Journal of Combinatorial Theory Series B,29 (1980) pp. 345–346.MATHMathSciNetGoogle Scholar
  474. [474]
    A. Waller, An Upper Bound for List T-Colorings, Bulletin of the London Mathematical Society, 28 (1995) pp. 337–342.MathSciNetGoogle Scholar
  475. [475]
    W.D. Wallis and G.H. Zhang, On the Partition and Coloring of a Graph by Cliques, Discrete Mathematics, 120 (1993) pp. 191–203.MATHMathSciNetGoogle Scholar
  476. [476]
    C.C. Wang, An Algorithm for the Chromatic Number of a Graph, Journal of the ACM, 21 (1974) pp. 385–391.MATHGoogle Scholar
  477. [477]
    D-I. Wang, The Channel Assignment Problem and Closed Neighborhood Containment Graphs, Ph.D. Thesis, Northeastern University, Boston, MA, (1985).Google Scholar
  478. [478]
    D.J.A. Welsh and M.B. Powell, An Upper Bound for the Chromatic Number of a Graph and its Applications to Timetabling Problems, The Computer Journal, 10 (1967) pp. 85–86.MATHGoogle Scholar
  479. [479]
    White, Graphs, Groups and Surfaces, North-Holland, Amsterdam, (1984).Google Scholar
  480. [480]
    A. Wigderson, Improving the Performance Guarantee for Approximate Graph Coloring, Journal of the ACM, 30 (1983) pp. 729–735.MATHMathSciNetGoogle Scholar
  481. [481]
    A. Wigderson, A New Approximate Graph Coloring Algorithm, in Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing,NCPY (1982) pp. 325–329.Google Scholar
  482. [482]
    H.S. Wilf, Backtrack: An O(1) Expected Time Algorithm for the Graph Coloring Problem, Information Processing Letters, 18 (1984) pp. 119–121.MATHMathSciNetGoogle Scholar
  483. [483]
    H.S. Wilf, Spectral Bounds for the Clique and Independence Numbers of Graphs, Journal of Combinatorial Theory Series B,40 (1986) pp. 113–117.MATHMathSciNetGoogle Scholar
  484. [484]
    H.S. Wilf, The Eigenvalues of a Graph and its Chromatic Number, J. London Math. Soc., 42 (1967) pp. 330–332.MATHMathSciNetGoogle Scholar
  485. [485]
    R.S. Wilkov and W.H. Kim, A Practical Approach to the Chromatic Partition Problem, J. Franklin Inst., 289 (1970) pp. 333–349.MATHMathSciNetGoogle Scholar
  486. [486]
    M.R. Williams, The Colouring of Very Large Graphs, in R. Guy et al, editor, Combinatorial Structures and Their Applications, Gordon and Breach, (1970) pp. 477–478.Google Scholar
  487. [487]
    C. P. Williams and T. Hogg, Extending deep structure, in Proc. of AAAI93, AAAI Press, Menlo Park, CA, (1993) pp. 152–157.Google Scholar
  488. [488]
    C. P. Williams and T. Hogg, Using deep structure to locate hard problems, in Proc. of AAAI92, AAAI Press, Menlo Park, CA, (1992) pp. 472–477.Google Scholar
  489. [489]
    T.K. Woo, S.Y.W. Su and R. Newmanwolfe, Resource-Allocation in a Dynamically Partitionable Bus Network Using a Graph-Coloring Algorithm, IEEE Transactions on Communications, 39 (1991) pp. 1794–1801.Google Scholar
  490. [490]
    D.C. Wood, A Technique for Coloring a Graph Applicable to Large Scale Timetabling Problems, The Computer Journal,12 (1969) pp. 317–319.MATHMathSciNetGoogle Scholar
  491. [491]
    D.C. Wood, A System for Computing University Examination Timetables, The Computer Journal, 11 (1968) pp. 41–47.MATHGoogle Scholar
  492. [492]
    D.R. Woodall, Improper Colourings of Graphs, in Graph Colourings, R. Nelson and R.J. Wilson (eds.), Pitman Research Notes in Mathematics Series 218, John Wiley & Sons, New York, (1990) pp. 45–63Google Scholar
  493. [493]
    D.R. Woodall and R.J. Wilson, The Appel-Haken Proof of the Four Color Theorem, Selected Topics in Graph Theory Vol. 16 of Lectures Notes in Mathematics Pitman, (1977) pp. 83–101.Google Scholar
  494. [494]
    A.R. Woods, Coloring Rules for Finite Trees, and Probabilities of Monadic 2nd-Order Sentences, Random Structure & Algorithms 10 (1997) pp. 453–485.MATHMathSciNetGoogle Scholar
  495. [495]
    J. Xue, Solving the Minimum Weighted Integer Coloring Problem, J. of Computational Optimization and Applications to appear.Google Scholar
  496. [496]
    J. Xue, Edge-Maximal Triangulated Subgraphs and Heuristics for the Maximum Clique Problem, NETWORKS 24 (1994) pp. 109–120.MATHMathSciNetGoogle Scholar
  497. [497]
    H.P. Yap, B.L. Chen and H.L. Fu, Total Chromatic Number of Graphs of Order 2N+1 having Maximum Degree 2N-1, Journal of the London Mathematical Society-Second Series 52 (1995) pp. 434–446.MATHMathSciNetGoogle Scholar
  498. [498]
    S.S.W. Yeh. Odd Cycles, Bipartite Subgraphs, and Approximate Graph Coloring, Publ. Princeton University, Princeton, NJ, 1989. UMI order no: GAX89–17763.Google Scholar
  499. [499]
    J.W.T. Youngs, Remarks on the Four Color Problem, in Richard Guy, Haim Hanani, Norbert Sauer, and Jonathan Schonheim, editors, Combinatorial Structures and Their Applications: Proceedings of the Calgary International Conference on Combinatorial Structures and Their Applications Gordon and Breach, (1969) pp. 479–480.Google Scholar
  500. [500]
    T. Zaslaysky, The Signed Chromatic Number of the Projective Plane and Klein Bottle and Antipodal Graph-Coloring, Journal of Combinatorial Theory Series B 63 (1995) pp. 136–145.MathSciNetGoogle Scholar
  501. [501]
    T. Zaslaysky, Signed Graph Coloring, Discrete Mathematics 39(2) (1982) pp. 215–228.MathSciNetGoogle Scholar
  502. [502]
    J. Žerovnik, A Parallel Variant of a Heuristical Algorithm for Graph Coloring, Parallel Computing 13 (1990) pp. 95–100.MATHGoogle Scholar
  503. [503]
    J. Žerovnik, A Randomised Heuristical Algorithm for Estimating the Chromatic Number of a Graph, Information Processing Letters 33 (1989) pp. 213–219.MATHMathSciNetGoogle Scholar
  504. [504]
    Z.F. Zhang, J.F. Wang, W.F. Wang and L.X. Wang, The Complete Chromatic Number of Some Planar Graphs, Science in China series A-Mathematics Physics Astronomy & Technological Sciences 36 (1993) pp. 1169–1177.MATHGoogle Scholar
  505. [505]
    X. Zhou, S. Nakano and T. Nishizeki, Edge-Coloring Partial k-Trees, Journal of Algorithms 21 (1996) pp. 598–617.MATHMathSciNetGoogle Scholar
  506. [506]
    X. Zhou, H. Suzuki and T. Nishizeki, An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs, Journal of Algorithms 23 (1997) pp. 359–374.MATHMathSciNetGoogle Scholar
  507. [507]
    X. Zhou, H. Suzuki and T. Nishizeki, A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs, Journal of Algorithms 20 (1996) pp. 174–201.MATHMathSciNetGoogle Scholar
  508. [508]
    A.X. Zhu, Non-coloring Contradiction Graphs and a Graph Coloring Algorithm, Chinese Journal of Computers 8(3) Chinese: English summary, (1985) pp. 189–197.MathSciNetGoogle Scholar
  509. [509]
    A. Zobel, Program Structure as Basis for the Parallelization of Global Register Allocation, Computer Language 19(2) (1993) pp. 135–155.MATHMathSciNetGoogle Scholar
  510. [510]
    J.A. Zoellner and C.L. Beall, A Breakthrough in Spectrum Conserving Frequency Assignment Technology, IEEE Transactions on Electromag. Comput. EMC-19 (1977) pp. 313–319.Google Scholar
  511. [511]
    J.A. Zoellner, Frequency Assignment Games and Strategies, IEEE Transactions on Electromagnetic Compatibility EMC-15 (1973) pp. 191–196.Google Scholar

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • Panos M. Pardalos
    • 1
  • Thelma Mavridou
    • 1
  • Jue Xue
    • 2
  1. 1.Center for Applied Optimization, ISE DepartmentUniversity of FloridaGainesvilleUSA
  2. 2.Department of Management SciencesThe City University of Hong KongKowloon, Hong KongChina

Personalised recommendations