Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs

DOI10.1002/(SICI)1097-0118(200004)33:4%3C199::AID-JGT2%3E3.0.CO;2-7zbMATH Open0944.05040OpenAlexW4255847243MaRDI QIDQ4948749FDOQ4948749

Authors: D. G. Hoffman, Mathew Cropper, John Goldwasser, A. J. W. Hilton, P. D. jun. Johnson 

Publication date: 24 September 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200004)33:4%3C199::aid-jgt2%3E3.0.co;2-7

Recommendations

• scientific article; zbMATH DE number 1161390
• scientific article; zbMATH DE number 1934405
• scientific article; zbMATH DE number 1735800
• scientific article; zbMATH DE number 4208092

zbMATH Keywords

cliquelist-coloringslist-multicolorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• On Representatives of Subsets
• The Marriage Problem

Cited In (7)

• Title not available (Why is that?)
• Refinements of Hall's condition
• Distributed algorithms for fractional coloring
• Edge list multicoloring trees: An extension of Hall's theorem
• List multicoloring problems involving the \(k\)-fold Hall numbers
• Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable
• Hall's condition for list-coloring, and the Hall parameters: Recent developments

This page was built for publication: Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs

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