Every graph \(G\) is Hall \(\Delta(G)\)-extendible

zbMath1351.05076MaRDI QIDQ727195

Erik E. Westlund, Jennifer Vandenbussche, Sarah Heuss Holliday

Publication date: 6 December 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p19

zbMATH Keywords

vertex coloringlist coloringprecoloring extensionHall's conditionHall \(k\)-extendible

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Unnamed Item

Cites Work

• Distance constraints in graph color extensions
• You can't paint yourself into a corner
• Extending precolorings of subgraphs of locally planar graphs
• Completing partial proper colorings using Hall's condition
• Extending colorings of locally planar graphs
• Precoloring Extensions of Brooks' Theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Every graph \(G\) is Hall \(\Delta(G)\)-extendible