Precoloring extension III: Classes of perfect graphs

Combinatorics Probability and Computing

Volumn 5, Issue 1, 1996, Pages 35-56

  Hujter, M ^a   Tuza, Zs ^b  

^a UNIVERSITY OF MISKOLC   (Hungary)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030536472     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548300001826     Document Type: Article

References (31)

1. 5-free graphs. Periodica Math. Hungar. 21 303-308.
2. Biró, M., Hujter, M. and Tuza, Zs. (1990) Precolouring extension. Preprint (Computer and Automation Institute, Budapest).
3. Biró, M., Hujter, M. and Tuza, Zs. (1992) Precolouring extension. I. Interval graphs. Discrete Math. 100 267-279.
4. Bodlaender, H. L., Jansen, K. and Woeginger, G. J. (1992) Scheduling with incompatible jobs. Preprint (Technical University, Graz).
5. Cook, S. A. (1971) The complexity of theorem proving procedures. Proc. 3rd Annual ACM Symposium on Theory of Computing 151-158.
6. Corneil, D. G., Lerchs, H. and Stewart Burlingham, L. (1981) Complement reducible graphs. Discrete Appl. Math. 3 163-174.
7. Corneil, D. G., Perl, Y. and Stewart, L. K. (1985) A linear recognition algorithm for cographs. SIAM J. Comput. 14 926-934.
8. Földes, S., and Hammer, P. L. (1977) Split graphs. Congr. Numer. 19 311-315.
9. Fulkerson, D. R. (1971) Blocking and anti-blocking pairs of polyhedra. Math. Programming 1 50-71.
10. Golumbic, M. C. (1980) Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York.
11. Golumbic, M. C. and Goss, C. F. (1978) Perfect elimination and chordal bipartite graphs. J. Graph Theory 2 155-163.
12. Grötschel, M., Lovász, L. and Schrijver, A. (1981) The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 169-197.
13. Grötschel, M., Lovász, L. and Schrijver, A. (1984) Polynomial algorithms for perfect graphs. Ann. Discrete Math. 21 325-356.
14. Gyárfás, A. and Lehel, J. (1970) A Helly-type problem in trees. In: Colloq. Math. Soc. J. Bolyai, 4., Combinatorial Theory and Its Applications, Vol. 2. North-Holland, Amsterdam. 571-584.
15. Hammer, P. L., Maffray, F. and Preissmann, M. (1989) A characterization of chordal bipartite graphs. Rutcor Research Report #16-89 (Rutgers University, New Brunswick, New Jersey).
16. Hammer, P. L., Peled, U. N. and Sun, X. (1990) Difference graphs. Discrete Appl. Math. 28 35-44.
17. Harary, F. and Tuza, Zs. (1993) Two graph-colouring games. Bull. Austral. Math. Soc. 48 151-159.
18. Hertz, A. (1989) Slim graphs. Graphs and Combinatorics 5 149-157.
19. 5/2 algorithm for maximum matching in bipartite graphs. SIAM J. Computing 2 225-231.
20. Hujter, M. and Tuza, Zs. (1993) Precoloring extension. II. Graph classes related to bipartite graphs. Acta Math. Univ. Comenianae 62 1-11.
21. Hujter, M. and Tuza, Zs. (1994) Precolouring extension. IV. General bounds and list colorings. in preparation.
22. Jansen, K. and Scheffler, P. (1993) Generalized coloring for tree-like graphs. Lecture Notes in Computer Science 657 50-59.
23. König, D., (1916) Gráfok és alkalmazásuk a determinánsok és halmazok elméletében (Hungarian). [Graphs and their applications in the theories of determinants and sets] Matematikai és Természettudományi Értesíto 34 104-119. [(1966) German translation: Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre, Math. Ann. 77 453-465.]
24. König, D., (1916) Gráfok és alkalmazásuk a determinánsok és halmazok elméletében (Hungarian). [Graphs and their applications in the theories of determinants and sets] Matematikai és Természettudományi Értesíto 34 104-119. [(1966) German translation: Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre, Math. Ann. 77 453-465.]
25. König, D. (1936) Theorie der Endlichen und Unendlichen Graphen (German). [Theory of finite and infinite graphs] Akademische Verlagsgeselschaft, Leipzig. [(1950) Reprinted Chelsea, New York; (1990) Translated into English by McCoart, M., Birkhäuser.]
26. Kratochvíl, J. (1993) Precolouring extension with fixed color bound. Acta Math. Univ. Comenianae 62 139-153.
27. Kratochvíl, J., and Tuza, Zs. (1994) Algorithmic complexity of list colorings. Discrete Appl. Math. 50 297-302.
28. Lovász, L. (1972) A characterization of perfect graphs. J. Combin. Theory B 13 95-98.
29. Marcotte, O. and Seymour, P. D. (1990) Extending an edge-coloring. J. Graph Theory 14 565-573.
30. Sebo, A. (1992) private communication.
31. Vizing, V. G. (1965) Critical graphs with a given chromatic class (Russian). Diskret Analiz. 5 9-17.