Precoloring extension. I. Interval graphs

@article{Bir1992PrecoloringEI,
  title={Precoloring extension. I. Interval graphs},
  author={Mikl{\'o}s Bir{\'o} and Mih{\'a}ly Hujter and Zsolt Tuza},
  journal={Discrete Mathematics},
  year={1992},
  volume={100},
  pages={267-279}
}
of the following general problem on vertex colorings of graphs. Suppose that some vertices of a graph G are assigned to some colors. Can this ‘precoloring’ be extended to a proper coloring of G with at most k colors (for some given k)? This question was motivated by practical problems in scheduling and VLSI theory. Here we investigate its complexity status for interval graphs and for graphs with a bounded treewidth. 1. Introduction. We consider …nite undirected graphs G = (V;E) with vertex set… CONTINUE READING
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 51 extracted citations

Parameterized and Exact Computation

Lecture Notes in Computer Science • 2004
View 11 Excerpts
Highly Influenced

Routing equal-size messages on a slotted ring

J. Scheduling • 2012
View 4 Excerpts
Highly Influenced

Designing RNA Secondary Structures is NP-Hard

Édouard Bonnet, Paweł Rzążewski, Florian Sikora
2017
View 1 Excerpt
Highly Influenced

Precoloring extension on unit interval graphs

Discrete Applied Mathematics • 2006
View 5 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 15 references

A variation of Ryser’s theorem and a necessary condition for the list-colouring problem

A. Hilton, P. Johnson
in: R. Nelson and R. J. Wilson, eds., Graph Colorings • 1990
View 1 Excerpt

Extending an edge-coloring

Journal of Graph Theory • 1990
View 1 Excerpt

What graphs have bounded tree-width

P. Sche­ er
Rostock. Math. Kolloq • 1990
View 2 Excerpts

Complexity of …nding embeddings in a k-tree

S. Arnborg, D. G. Corneil, A. Proskurowski
SIAM J. Algebraic Discrete Methods 8 • 1987
View 2 Excerpts

Graph minors

N. Robertson, P. Seymour
II. Algorithmic aspects of tree-width, J. Algorithms 7 • 1986
View 2 Excerpts

Channel routing of nets bounded degree

F. P. Preparata, M. Sarrafzadeh
in: P. Bertolazzi and F. Luccio, eds., VLSI: Algorithms and Architectures • 1985
View 2 Excerpts

Extremely greedy coloring algorithms

B. Manvel
in: F. Harary and J. S. Maybee, eds., Graphs and Combinatorics • 1985
View 1 Excerpt

Similar Papers

Loading similar papers…