Extending graph colorings using no extra colors
From MaRDI portal
Publication:5936057
DOI10.1016/S0012-365X(00)00376-9zbMath0999.05030OpenAlexW2014385271MaRDI QIDQ5936057
Emily H. Moore, Michael O. Albertson
Publication date: 2 December 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00376-9
Related Items (10)
Precoloring extension involving pairs of vertices of small distance ⋮ Extension from precoloured sets of edges ⋮ Extensions of Fractional Precolorings Show Discontinuous Behavior ⋮ Distance constraints in graph color extensions ⋮ Restricted extension of sparse partial edge colorings of hypercubes ⋮ Extending precolorings to circular colorings ⋮ Unnamed Item ⋮ Precoloring extension forK4-minor-free graphs ⋮ Precoloring extension for 2-connected graphs with maximum degree three ⋮ Extending partial 5-colorings and 6-colorings in planar graphs
This page was built for publication: Extending graph colorings using no extra colors