Extending Hall's theorem into list colorings: a partial history
From MaRDI portal
Publication:925374
Recommendations
Cites work
- scientific article; zbMATH DE number 4134075 (Why is no real title available?)
- scientific article; zbMATH DE number 4208092 (Why is no real title available?)
- scientific article; zbMATH DE number 4218322 (Why is no real title available?)
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 1229624 (Why is no real title available?)
- scientific article; zbMATH DE number 1735800 (Why is no real title available?)
- scientific article; zbMATH DE number 1151851 (Why is no real title available?)
- A Theorem on General Measure Functions
- Characterization of graphs with hall number 2
- Edge list multicoloring trees: An extension of Hall's theorem
- Hall's condition for list-coloring, and the Hall parameters: Recent developments
- List multicolorings of graphs with measurable sets
- On Representatives of Subsets
- Representation of systems of measurable sets
- The Marriage Problem
- The list chromatic index of a bipartite multigraph
- Transversals and matroid partition
- n-tuple colorings and associated graphs
Cited in
(6)
This page was built for publication: Extending Hall's theorem into list colorings: a partial history
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925374)