Extending partial colorings of graphs

DOI10.1016/S0012-365X(99)00372-6MaRDI QIDQ1567669zbMATH OpenOpenAlexFDO

Authors H. A. Kierstead

Publication date 15 September 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(99)00372-6

zbMATH Keywords

perfect graph\(k\)-cliquehighly recursive graphpartial coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)

Recommendations

• Extending graph colorings
• Precoloring Extension III: Classes of Perfect Graphs
• Extending graph colorings using no extra colors

Cited in

(10)

• Avoiding and extending partial edge colorings of hypercubes
• Extending precolorings to circular colorings
• Extending partial 3-colourings in a planar graph
• Restricted extension of sparse partial edge colorings of complete graphs
• Extending graph colorings
• Extending graph colorings using no extra colors
• Restricted extension of sparse partial edge colorings of hypercubes
• Extension of colorings
• Graph color extensions: When Hadwiger's conjecture and embeddings help
• Partial DP-coloring of graphs

This page was built for publication: Extending partial colorings of graphs

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