Precoloring extension. I. Interval graphs
- 15 May 1992
- journal article
- Published by Elsevier BV in Discrete Mathematics
- Vol. 100 (1-3), 267-279
- https://doi.org/10.1016/0012-365x(92)90646-w
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Extending an edge‐coloringJournal of Graph Theory, 1990
- On embedding graphs in treesJournal of Combinatorial Theory, Series B, 1990
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- List-colourings of graphsGraphs and Combinatorics, 1985
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- The Complexity of Coloring Circular Arcs and ChordsSIAM Journal on Algebraic Discrete Methods, 1980
- An Efficient Test for Circular-Arc GraphsSIAM Journal on Computing, 1980
- An application of graph coloring to printed circuit testingIEEE Transactions on Circuits and Systems, 1976