Precoloring extension on unit interval graphs

Authors:
Dániel Marx
Affiliations:
Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Budapest, Hungary
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 4
Cited 1

Precoloring extension. I: Interval graphs

Discrete Mathematics - Special volume (part 1) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs”
NP-completeness of some edge-disjoint paths problems

Discrete Applied Mathematics
A short proof that “proper = unit”

Discrete Mathematics - Special issue on partial ordered sets
Eulerian disjoint paths problem in grid graphs is NP-complete

Discrete Applied Mathematics

Register allocation by puzzle solving

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation

Quantified Score

Hi-index	0.04

Visualization

Abstract

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.