Precoloring Extensions of Brooks' Theorem

DOI10.1137/S0895480103425942zbMath1069.05031OpenAlexW2013202788MaRDI QIDQ5317568

Michael O. Albertson, Douglas B. West, Alexandr V. Kostochka

Publication date: 16 September 2005

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

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

zbMATH Keywords

list coloringcoloring extension

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (13)

Precoloring extension involving pairs of vertices of small distance ⋮ Extending precolorings to distinguish group actions ⋮ Extension from precoloured sets of edges ⋮ Distance constraints in graph color extensions ⋮ The complexity of changing colourings with bounded maximum degree ⋮ Brooks' theorem with forbidden colors ⋮ Flexibility of planar graphs -- sharpening the tools to get lists of size four ⋮ Extending precolorings to circular colorings ⋮ Hard coloring problems in low degree planar bipartite graphs ⋮ Every graph \(G\) is Hall \(\Delta(G)\)-extendible ⋮ Unnamed Item ⋮ Precoloring extension for 2-connected graphs with maximum degree three ⋮ On Baire measurable colorings of group actions

This page was built for publication: Precoloring Extensions of Brooks' Theorem