论文信息 - A Generalization of the Graph Coloring Problem

A Generalization of the Graph Coloring Problem

This paper presents a generalization of the graph coloring problem. We study its properties and generalize some well-known bounds and de nitions.We propose a generalization of perfect graphs and analize the complexity of the problem. An heuristic is developed to seek "good" solutions and we report their results for random graphs. An IP formulation allows us to evaluate the heuristic in small dimension instances.

Isabel M endez D az Paula Zabala

[1] Walter Meyer. Five-coloring planar maps , 1972 .

[2] S. H. Scott,et al. A (<5)-Colour Theorem for Planar Graphs , 1973 .

[3] G. A. Dirac,et al. Note on the colouring of graphs , 1951 .

[4] M. Golummc. Algorithmic graph theory and perfect graphs , 1980 .

[5] Leizhen Cai,et al. A generalization of perfect graphs - i-perfect graphs , 1996, J. Graph Theory.

[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7] G. Chartrand,et al. A generalization of the chromatic number , 1968, Mathematical Proceedings of the Cambridge Philosophical Society.

[8] David S. Johnson,et al. The Complexity of Near-Optimal Graph Coloring , 1976, J. ACM.

[9] R. Halin,et al. Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl , 1967 .

[10] S. E. Markosyan,et al. ω-Perfect graphs , 1990 .

[11] P. Erdos,et al. On chromatic number of graphs and set-systems , 1966 .

[12] E. Balas,et al. Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .

[13] Frank Harary,et al. Graph Theory , 2016 .

[14] D. R. Lick,et al. k-Degenerate Graphs , 1970, Canadian Journal of Mathematics.

[15] K. R. Parthasarathy,et al. The validity of the strong perfect-graph conjecture for (K4-e)-free graphs , 1979, J. Comb. Theory, Ser. B.

[16] David S. Johnson,et al. The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.