NP-completeness of list coloring and precoloring extension on the edges of planar graphs

Journal of Graph Theory

Volumn 49, Issue 4, 2005, Pages 313-324

  Marx, Dániel ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

Edge coloring; List coloring; NP completeness; Precoloring extension

Indexed keywords

COLOR; GRAPH THEORY;

EDGE COLORING; LIST COLORING; NP-COMPLETENESS; PRECOLORING EXTENSION;

COMPUTATIONAL COMPLEXITY;

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

References (30)

1. M. Biró, M. Hujter, and Zs. Tuza, Precoloring extension. I. Interval graphs, Discrete Math 100(1-3) (1992), 267-279.
2. H. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theor Comput Sci 209(1-2) (1998), 1-45.
3. C. J. Colbourn, The complexity of completing partial Latin squares, Discrete Appl Math 8(1) (1984), 25-30.
4. B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Inform Comput 85(1) (1990), 12-75.
5. D. de Werra, M. Demange, B. Escoffier, J. Monnot, and V. T. Paschos, Weighted coloring on planar, bipartite, and split graphs: Complexity and improved approximation, in ISAAC 2004, 2004.
6. T. Easton and R. G. Parker, On completing Latin squares, Discrete Appl Math 113(2-3) (2001), 167-181.
7. P. Erdös, A. L. Rubin, and H. Taylor, Choosability in graphs, in Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing (Humboldt State Univ., Arcata, Calif., 1979), Winnipeg, Manitoba, 1980, Utilitas Math, pp. 125-157.
8. J. Fiala, NP completeness of the edge precoloring extension problem on bipartite graphs, J Graph Theory 43(2) (2003), 156-160.
9. T. Fujino, I. Isobe, X. Zhou, and T. Nishizeki, Linear algorithm for finding list edge-colorings of series-parallel graphs, IEICE Trans Fundamentals, E86-D 2 (2003), 186-190.
10. T. Fujino, X. Zhou, and T. Nishizeki, List edge-colorings of series-parallel graphs, IEICE Trans Fundamentals, E86-A 5 (2003), 1034-1045.
11. I. Holyer, The NP-completeness of edge-coloring, SIAM J Comput 10(4) (1981), 718-720.
12. M. Hujter and Zs. Tuza, Precoloring extension. II. Graph classes related to bipartite graphs, Acta Mathematica Universitatis Comenianae 62(1) (1993), 1-11.
13. M. Hujter and Zs. Tuza, Precoloring extension. III. Classes of perfect graphs, Combin Probab Comput 5(1) (1996), 35-56.
14. K. Jansen and P. Scheffler, Generalized coloring for tree-like graphs, Discrete Appl Math 75(2) (1997), 135-155.
15. M. Juvan, B. Mohar, and R. Thomas, List edge-colorings of series-parallel graphs, Electron J Combin 6(1) (1999) Research Paper 42, 6 pp. (electronic). 1999.
16. D. König, Über graphen und ihre andwendung auf determinantentheorie und mengenlehre, Math Ann 77 (1916), 453-465.
17. J. Kratochvíl, Precoloring extension with fixed color bound, Acta Mathematica Universitatis Comenianae 62(2) (1993), 139-153.
18. D. Leven and Z. Galil, NP completeness of finding the chromatic index of regular graphs, Journal of Algorithms 4(1) (1983), 35-44.
19. O. Marcotte and P. D. Seymour, Extending an edge-coloring, J Graph Theory 14(5) (1990), 565-573.
20. D. Marx, Complexity results for minimum sum edge coloring, 2004. Manuscript.
21. D. Marx, List edge multicoloring in graphs with few cycles, Inform Process Lett 89(2) (2004), 85-90.
22. C. Moore and J. M. Robson, Hard tiling problems with simple tiles, Discrete Comput Geom 26(4) (2001), 573-590.
23. T. Nishizeki, J. Vygen, and X. Zhou, The edge-disjoint paths problem is NP-complete for series-parallel graphs, Discrete Appl Math 115(1-3) (2001), 177-186.
24. C. H. Papadimitriou, Computational Complexity, Addison-Wesley Publishing Company, Reading, MA, 1994.
25. D. P. Sanders and Y. Zhao, Planar graphs of maximum degree seven are class I, J Combin Theory Ser B 83(2) (2001), 201-212.
26. Zs. Tuza, Graph colorings with local constraints - a survey, Discuss Math Graph Theory 17(2) (1997), 161-228.
27. V. G. Vizing, On an estimate of the chromatic class of a p-graph, Diskret Analiz No 3 (1964), 25-30.
28. V. G. Vizing, Coloring the vertices of a graph in prescribed colors, Diskret Analiz (29 Metody Diskret. Anal. v Teorii Kodov i Shem), 3-10, (1976), 101.
29. J. L. Wu, List-edge coloring of series-parallel graphs, Shandong Daxue Xuebao Ziran Kexue Ban 35(2) (2000), 144-149, (in Chinese).
30. X. Zhou and T. Nishizeki, Edge-coloring and f-coloring for various classes of graphs, J Graph Algorithms Appl 3(1) (1999), 18.