Hall number for list colorings of graphs: Extremal results

DOI10.1016/j.disc.2009.03.025zbMath1185.05067OpenAlexW1998760346MaRDI QIDQ960954

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

zbMATH Keywords

graphvertex coloringlist coloringchoice numberHall numberHall condition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items

Unnamed Item

Cites Work

• The Hall number, the Hall index, and the total Hall number of a graph
• The list chromatic index of a bipartite multigraph
• Extremal jumps of the Hall number
• Graph colorings with local constraints -- a survey
• Characterization of graphs with hall number 2
• On Representatives of Subsets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item