Extending graph colorings

DOI10.1006/jctb.1999.1913zbMath1024.05027OpenAlexW2026305069MaRDI QIDQ1569052

Emily H. Moore, Michael O. Albertson

Publication date: 25 June 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1999.1913

zbMATH Keywords

distancecoloring extension\(r\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (13)

Precoloring extension involving pairs of vertices of small distance ⋮ Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings ⋮ List homomorphisms of graphs with bounded degrees ⋮ Distance constraints in graph color extensions ⋮ On list-coloring outerplanar graphs ⋮ Extending precolourings of circular cliques ⋮ Extending precolorings to circular colorings ⋮ Precoloring extension forK₄-minor-free graphs ⋮ Extension problems with degree bounds ⋮ Partitioning chordal graphs into independent sets and cliques ⋮ Precoloring extension for 2-connected graphs with maximum degree three ⋮ Extending colorings of planar graphs ⋮ Extending partial 5-colorings and 6-colorings in planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Precoloring extension. I: Interval graphs
• You can't paint yourself into a corner
• Every planar graph is 5-choosable
• Color-critical graphs on a fixed surface
• Graph colorings with local constraints -- a survey
• Precoloring Extension III: Classes of Perfect Graphs

This page was built for publication: Extending graph colorings