Article thumbnail
Location of Repository

Precoloring extension on chordal graphs

By Dániel Marx


In the precoloring extension problem (PrExt) 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. 1-PrExt is the special case where every color is assigned to at most one vertex in the precoloring. Answering an open question of Hujter and Tuza [HT96], we show that the 1-PrExt problem can be solved in polynomial time for chordal graphs.

Publisher: Birkhäuser
Year: 2004
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.