Precoloring extension for 2-connected graphs with maximum degree three

DOI10.1016/j.disc.2008.05.024zbMath1209.05102OpenAlexW2059810357MaRDI QIDQ1044924

Margit Voigt

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.05.024

zbMATH Keywords

list coloringdistance constraintsprecoloring extension

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Precoloring extension involving pairs of vertices of small distance ⋮ Brooks' theorem with forbidden colors ⋮ Precoloring extension forK₄-minor-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph color extensions: When Hadwiger's conjecture and embeddings help
• You can't paint yourself into a corner
• The colour theorems of Brooks and Gallai extended
• 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 Extensions of Brooks' Theorem
• Precoloring Extension for 2‐connected Graphs
• Extending graph colorings using no extra colors

This page was built for publication: Precoloring extension for 2-connected graphs with maximum degree three