# 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} }

- Published 1992 in Discrete Mathematics
DOI:10.1016/0012-365X(92)90646-W

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

#### From This Paper

##### Topics from this paper.

#### Citations

##### Publications citing this paper.

Showing 1-10 of 51 extracted citations

## Parameterized and Exact Computation

View 11 Excerpts

Highly Influenced

## A Technique for Exact Computation of precoloring Extension on Interval Graphs

View 4 Excerpts

Highly Influenced

## Routing equal-size messages on a slotted ring

View 4 Excerpts

Highly Influenced

## Incremental List Coloring of Graphs, Parameterized by Conservation

View 11 Excerpts

Highly Influenced

## Designing RNA Secondary Structures is NP-Hard

View 1 Excerpt

Highly Influenced

## Algorithmic Applications of Tree-Cut Width

View 5 Excerpts

Highly Influenced

## Register allocation by puzzle solving

View 5 Excerpts

Highly Influenced

## Precoloring extension on unit interval graphs

View 5 Excerpts

Highly Influenced

## Precoloring Extension with Fixed Color Bound

View 3 Excerpts

Highly Influenced

## Klavı́k Extending Partial Representations of Graphs

View 4 Excerpts

Highly Influenced

#### References

##### Publications referenced by this paper.

Showing 1-10 of 15 references

## A variation of Rysers theorem and a necessary condition for the list-colouring problem

View 1 Excerpt

## Extending an edge-coloring

View 1 Excerpt

## What graphs have bounded tree-width

View 2 Excerpts

## Complexity of
nding embeddings in a k-tree

View 2 Excerpts

## Graph minors

View 2 Excerpts

## Channel routing of nets bounded degree

View 2 Excerpts

## Extremely greedy coloring algorithms

View 1 Excerpt