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
Parameterized coloring problems on chordal graphs
Theoretical Computer Science - Parameterized and exact computation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Minimum cost homomorphisms to oriented cycles with some loops
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Incremental list coloring of graphs, parameterized by conservation
Theoretical Computer Science
On the complexity of global scheduling constraints under structural restrictions
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.05 |
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.