Hall number for list colorings of graphs: Extremal results
From MaRDI portal
Publication:960954
DOI10.1016/J.DISC.2009.03.025zbMATH Open1185.05067OpenAlexW1998760346MaRDI QIDQ960954FDOQ960954
Authors: Zsolt Tuza
Publication date: 29 March 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.025
Recommendations
Cites Work
- Title not available (Why is that?)
- Graph colorings with local constraints -- a survey
- On Representatives of Subsets
- The list chromatic index of a bipartite multigraph
- Multicriterial graph problems with MAXMIN criterion
- Title not available (Why is that?)
- Characterization of graphs with hall number 2
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Hall number, the Hall index, and the total Hall number of a graph
- Extremal jumps of the Hall number
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Hall number for list colorings of graphs: Extremal results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960954)