Extending graph colorings using no extra colors

DOI10.1016/S0012-365X(00)00376-9MaRDI QIDQ5936057zbMATH OpenOpenAlexFDO

Authors Michael O. Albertson, Emily H. Moore

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

zbMATH Keywords

color extensionouterplanar graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Extending graph colorings
• Distance constraints in graph color extensions
• Precoloring extension involving pairs of vertices of small distance
• Extending partial colorings of graphs
• Extending precolorings to circular colorings

Cited in

(17)

• Precoloring extension for 2-connected graphs with maximum degree three
• Extending partial colorings of graphs
• Extending graph colorings
• Extension from precoloured sets of edges
• Extension of colorings
• Restricted extension of sparse partial edge colorings of hypercubes
• Extending precolorings to circular colorings
• Extending partial 5-colorings and 6-colorings in planar graphs
• Precoloring extension involving pairs of vertices of small distance
• Extensions of fractional precolorings show discontinuous behavior
• Precoloring extension forK₄-minor-free graphs
• Hall spectra and extending precolorings with extra colors
• Precoloring extension of Vizing's theorem for multigraphs
• Extending partial edge colorings of Cartesian products of graphs
• Edge precoloring extension of trees. II
• Extending edge-colorings of distance-2 matchings in the hypercube
• Distance constraints in graph color extensions

This page was built for publication: Extending graph colorings using no extra colors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5936057)