论文信息 - Precoloring extension on unit interval graphs

Precoloring extension on unit interval graphs

In the precoloring extension problem a graph is given with some of the vertices having preassigned colors and it has to be decided whether this coloring can be extended to a proper k-coloring of the graph. Answering an open question of Hujter and Tuza [Precoloring extension. III. Classes of perfect graphs, Combin. Probab. Comput. 5 (1) (1996) 35-56], we show that the precoloring extension problem is NP-complete on unit interval graphs.

Dániel Marx | D. Marx

[1] Peter L. Hammer,et al. Difference graphs , 1990, Discret. Appl. Math..

[2] Zsolt Tuza,et al. Precoloring extension. I. Interval graphs , 1992, Discret. Math..

[3] Theory Array Acm G. . Graph. Cross fertilisation of graph theory and aircraft maintenance scheduling , 1992 .

[4] Dániel Marx. Eulerian disjoint paths problem in grid graphs is NP-complete , 2004, Discret. Appl. Math..

[5] D. P. Bovet,et al. An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs , 1981 .

[6] Douglas B. West,et al. A short proof that 'proper = unit' , 1998, Discret. Math..

[7] Jens Vygen,et al. NP-completeness of Some Edge-disjoint Paths Problems , 1995, Discret. Appl. Math..

[8] András Recski,et al. Minimax Results and Polynomial Algorithms in VLSI Routing , 1992 .

[9] Alan Tucker,et al. An O(qn) algorithm to q-color a proper family of circular arcs , 1985, Discret. Math..

[10] P. Nguyen,et al. On the Disjoint Paths , 1998 .

[11] Stefan Hougardy,et al. Classes of perfect graphs , 2006, Discret. Math..

[12] Z. Tuza,et al. PRECOLORING EXTENSION. II. GRAPHS CLASSES RELATED TO BIPARTITE GRAPHS , 1993 .

[13] MATTHIAS MIDDENDORF,et al. On the complexity of the disjoint paths problem , 1993, Comb..

[14] Zsolt Tuza,et al. Precoloring Extension III: Classes of Perfect Graphs , 1996, Combinatorics, Probability and Computing.