BibTeX
@MISC{Marx04precoloringextension,
author = {Daniel Marx},
title = {Precoloring Extension on Unit Interval Graphs},
year = {2004}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In the precoloring extension problem we are given a graph with some of the vertices having a preassigned color 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 [6], we show that the precoloring extension problem is NP-complete on unit interval graphs.
