Precoloring Extension for 2‐connected Graphs

DOI10.1137/05064312XzbMath1139.05320OpenAlexW2090612300MaRDI QIDQ5454276

Margit Voigt

Publication date: 28 March 2008

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

Full work available at URL: https://doi.org/10.1137/05064312x

zbMATH Keywords

list coloringdistance constraintsprecoloring extension

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Precoloring extension involving pairs of vertices of small distance ⋮ Brooks' theorem with forbidden colors ⋮ Precoloring extension forK₄-minor-free graphs ⋮ Precoloring extension for 2-connected graphs with maximum degree three

This page was built for publication: Precoloring Extension for 2‐connected Graphs