Distance constraints in graph color extensions
From MaRDI portal
Publication:885289
DOI10.1016/j.jctb.2006.08.003zbMath1117.05042OpenAlexW1988281057MaRDI QIDQ885289
Joan P. Hutchinson, Emily H. Moore
Publication date: 8 June 2007
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.2006.08.003
Related Items (5)
Precoloring extension involving pairs of vertices of small distance ⋮ On list-coloring outerplanar graphs ⋮ Every graph \(G\) is Hall \(\Delta(G)\)-extendible ⋮ Unnamed Item ⋮ Precoloring extension forK4-minor-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List colourings of planar graphs
- Graph color extensions: When Hadwiger's conjecture and embeddings help
- Precoloring extension. I: Interval graphs
- You can't paint yourself into a corner
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- The four-colour theorem
- Color-critical graphs on a fixed surface
- Extending graph colorings
- A note on planar 5-list colouring: Non-extendability at distance 4
- A note on graph coloring extensions and list-colorings
- Extending precolorings of subgraphs of locally planar graphs
- Extending precolorings to circular colorings
- Extending colorings of locally planar graphs
- Every planar map is four colorable
- Graph colorings with local constraints -- a survey
- Precoloring Extension III: Classes of Perfect Graphs
- Precoloring Extensions of Brooks' Theorem
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- 25 pretty graph colouring problems
- Extending graph colorings using no extra colors
This page was built for publication: Distance constraints in graph color extensions
