List multicoloring problems involving the k-fold Hall numbers

DOI10.1002/jgt.20462zbMath1205.05086OpenAlexW4245604470MaRDI QIDQ3055924

Jenő Lehel, Mathew Cropper, Peter D. jun. Johnson, Anthony J. W. Hilton

Publication date: 10 November 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20462

zbMATH Keywords

Hall's conditionslist multicoloringthe \(k\)-fold Hall number of graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Extending Hall's theorem into list colorings: a partial history
• The \(k\)-fold list coloring of cycles with Hall's condition
• Characterization of graphs with hall number 2
• On Representatives of Subsets
• Edge list multicoloring trees: An extension of Hall's theorem
• Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs
• A Theorem on General Measure Functions
• The Marriage Problem
• Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs

This page was built for publication: List multicoloring problems involving the k-fold Hall numbers