NP completeness of the edge precoloring extension problem on bipartite graphs

Journal of Graph Theory

Volumn 43, Issue 2, 2003, Pages 156-160

  Fiala, Jiří ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Computational complexity; Graph coloring; Precoloring extension

Indexed keywords

EID: 0037708597     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.10088     Document Type: Article

References (6)

1. 1 M. Biro, M. Hujter, and Z. Tuza, Precoloring extension, I: Interval graphs, Discrete Mathematics 100 (1992), 267–279.
2. 2 I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Perennes, P. Persiano, and H. Rivano, Approximate constrained bipartite edge coloring, In: Graph‐Theoretical Concepts in Computer Science, 27th WG '01, Boltenhagen (2001), no. 2204 in Lecture notes in computer science, Springer Verlag, pp. 21–31.
3. 3 J. Fiala and J. Kratochvíl, Partial covers of graphs. Discussiones Mathematicae Graph Theory 22 (2002), 89–99.
4. 4 M. R. Garey and D. S. Johnson, Computers and intractability. W. H. Freeman and Co., New York, 1979.
5. 5 I. Holyer, The np‐completeness of edge coloring, SIAM J Comput 10 4 (1981), 718–720.
6. 6 J. Kratochvíl and A. Sebö, Coloring precolored perfect graphs, J Graph Theory 25 (1997), 207–215.