Extending precolorings to circular colorings
From MaRDI portal
Publication:2496199
DOI10.1016/j.jctb.2005.09.010zbMath1180.05040MaRDI QIDQ2496199
Douglas B. West, Michael O. Albertson
Publication date: 12 July 2006
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2005.09.010
05C15: Coloring of graphs and hypergraphs
Related Items
Graphs with bounded tree-width and large odd-girth are almost bipartite, Distance constraints in graph color extensions
Cites Work
- Unnamed Item
- Graph color extensions: When Hadwiger's conjecture and embeddings help
- You can't paint yourself into a corner
- Color-critical graphs on a fixed surface
- Extending graph colorings
- A note on graph coloring extensions and list-colorings
- Extending precolorings of subgraphs of locally planar graphs
- A note on the star chromatic number
- Star chromatic number
- Star chromatic numbers and products of graphs
- Graph colorings with local constraints -- a survey
- Precoloring Extensions of Brooks' Theorem
- Circular chromatic number: A survey
- Extending graph colorings using no extra colors