Precoloring extension forK4-minor-free graphs

DOI10.1002/jgt.20358zbMath1229.05155OpenAlexW1578293636MaRDI QIDQ3633010

Margit Voigt, Anja Pruchnewski

Publication date: 16 June 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20358

zbMATH Keywords

list coloringprecoloring extensionminor-free graphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Related Items (3)

Extending precolorings to distinguish group actions ⋮ On list-coloring outerplanar graphs ⋮ Flexibility of planar graphs -- sharpening the tools to get lists of size four

Cites Work

• Unnamed Item
• Distance constraints in graph color extensions
• Precoloring extension for 2-connected graphs with maximum degree three
• You can't paint yourself into a corner
• Extending graph colorings
• A note on graph coloring extensions and list-colorings
• Extending precolorings of subgraphs of locally planar graphs
• Extending colorings of locally planar graphs
• Precoloring Extension for 2‐connected Graphs
• Extending graph colorings using no extra colors

This page was built for publication: Precoloring extension forK₄-minor-free graphs