Precoloring extension. I: Interval graphs
From MaRDI portal
Publication:1198648
DOI10.1016/0012-365X(92)90646-WzbMath0766.05026MaRDI QIDQ1198648
Publication date: 16 January 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C15: Coloring of graphs and hypergraphs
Cites Work
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- List-colourings of graphs
- On embedding graphs in trees
- Asymptotically good list-colorings
- Extending an edge-coloring
- Graph minors. II. Algorithmic aspects of tree-width
- Complexity of Finding Embeddings in a k-Tree
- An Efficient Test for Circular-Arc Graphs
- The Complexity of Coloring Circular Arcs and Chords
- An application of graph coloring to printed circuit testing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item