A note on graph coloring extensions and list-colorings
From MaRDI portal
Publication:1871384
zbMath1017.05041MaRDI QIDQ1871384
Publication date: 7 May 2003
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/122779
Related Items (9)
Extension from precoloured sets of edges ⋮ Extensions of Fractional Precolorings Show Discontinuous Behavior ⋮ Distance constraints in graph color extensions ⋮ The complexity of changing colourings with bounded maximum degree ⋮ Brooks' theorem with forbidden colors ⋮ Unnamed Item ⋮ Extending precolorings to circular colorings ⋮ Precoloring extension forK4-minor-free graphs ⋮ Precoloring extension for 2-connected graphs with maximum degree three
This page was built for publication: A note on graph coloring extensions and list-colorings
