scientific article; zbMATH DE number 7198030

zbMath1439.05088MaRDI QIDQ5109073

Victor Larsen, Erik E. Westlund, Jennifer Vandenbussche

Publication date: 7 May 2020

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/76/ajc_v76_p346.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

list coloringHall's marriage theorem

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Every graph \(G\) is Hall \(\Delta(G)\)-extendible
• Distance constraints in graph color extensions
• Hall number for list colorings of graphs: Extremal results
• Hall's condition for list-coloring, and the Hall parameters: Recent developments
• Extending precolorings of subgraphs of locally planar graphs
• Completing partial proper colorings using Hall's condition
• Precoloring extension involving pairs of vertices of small distance
• Extending colorings of locally planar graphs
• Characterization of graphs with hall number 2
• Precoloring Extensions of Brooks' Theorem
• Extending graph colorings using no extra colors

This page was built for publication: