Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs
From MaRDI portal
Publication:4948749
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(200004)33:4<199::AID-JGT2>3.0.CO;2-7" /><199::AID-JGT2>3.0.CO;2-7 10.1002/(SICI)1097-0118(200004)33:4<199::AID-JGT2>3.0.CO;2-7zbMath0944.05040OpenAlexW4255847243MaRDI QIDQ4948749
D. G. Hoffman, Peter D. jun. Johnson, Mathew Cropper, John L. Goldwasser, Anthony J. W. Hilton
Publication date: 24 September 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200004)33:4<199::aid-jgt2>3.0.co;2-7
Related Items (5)
Edge list multicoloring trees: An extension of Hall's theorem ⋮ Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable ⋮ List multicoloring problems involving the k-fold Hall numbers ⋮ Unnamed Item ⋮ Distributed algorithms for fractional coloring
Cites Work
This page was built for publication: Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs
