Distance constraints in graph color extensions

DOI10.1016/J.JCTB.2006.08.003MaRDI QIDQ885289zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

block designHadwiger's conjectureprecoloring extensionlist-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Extending graph colorings
• Extending graph colorings using no extra colors
• Graph color extensions: When Hadwiger's conjecture and embeddings help
• Precoloring extension involving pairs of vertices of small distance
• Precoloring extension forK₄-minor-free graphs

Cites work

• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 1025912 (Why is no real title available?)
• scientific article; zbMATH DE number 772760 (Why is no real title available?)
• scientific article; zbMATH DE number 890665 (Why is no real title available?)
• scientific article; zbMATH DE number 3102312 (Why is no real title available?)
• 25 pretty graph colouring problems
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• A note on graph coloring extensions and list-colorings
• A note on planar 5-list colouring: Non-extendability at distance 4
• Color-critical graphs on a fixed surface
• Every planar map is four colorable
• Extending colorings of locally planar graphs
• Extending graph colorings
• Extending graph colorings using no extra colors
• Extending precolorings of subgraphs of locally planar graphs
• Extending precolorings to circular colorings
• Graph color extensions: When Hadwiger's conjecture and embeddings help
• Graph colorings with local constraints -- a survey
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• List colourings of planar graphs
• Precoloring Extension III: Classes of Perfect Graphs
• Precoloring Extensions of Brooks' Theorem
• Precoloring extension. I: Interval graphs
• The four-colour theorem
• You can't paint yourself into a corner

Cited in

(10)

• Extending graph colorings
• On list-coloring outerplanar graphs
• Precoloring Extensions of Brooks' Theorem
• Extending colorings of planar graphs
• Precoloring extension involving pairs of vertices of small distance
• Every graph G is Hall (G)-extendible
• Extending graph colorings using no extra colors
• Hall spectra and extending precolorings with extra colors
• Precoloring extension forK₄-minor-free graphs
• Extending precolourings of circular cliques

This page was built for publication: Distance constraints in graph color extensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q885289)