Extending Hall's theorem into list colorings: a partial history

DOI10.1155/2007/72168zbMath1139.05021OpenAlexW1974899452MaRDI QIDQ925374

D. G. Hoffman, Peter D. jun. Johnson

Publication date: 3 June 2008

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/54167

zbMATH Keywords

Hall's theoremindependence systemscolorings of graphslist colorings of graphs

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Hall's theorem and extending partial Latinized rectangles ⋮ List multicoloring problems involving the k-fold Hall numbers ⋮ List colorings with measurable sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• n-tuple colorings and associated graphs
• Hall's condition for list-coloring, and the Hall parameters: Recent developments
• The list chromatic index of a bipartite multigraph
• List multicolorings of graphs with measurable sets
• Representation of systems of measurable sets
• Characterization of graphs with hall number 2
• On Representatives of Subsets
• Edge list multicoloring trees: An extension of Hall's theorem
• Transversals and matroid partition
• A Theorem on General Measure Functions
• The Marriage Problem

This page was built for publication: Extending Hall's theorem into list colorings: a partial history