Characterization of graphs with hall number 2

DOI10.1002/jgt.10154zbMath1033.05040OpenAlexW4237458894MaRDI QIDQ4458593

Changiz Eslahchi, Matthew Johnson

Publication date: 15 March 2004

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10154

zbMATH Keywords

chromatic numberlist coloringchoice numberHall number

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Extending Hall's theorem into list colorings: a partial history ⋮ Hall's theorem and extending partial Latinized rectangles ⋮ Hall number for list colorings of graphs: Extremal results ⋮ List multicoloring problems involving the k-fold Hall numbers ⋮ Unnamed Item ⋮ Completing partial proper colorings using Hall's condition ⋮ Unnamed Item ⋮ Extremal jumps of the Hall number

Cites Work

• The Hall number, the Hall index, and the total Hall number of a graph

This page was built for publication: Characterization of graphs with hall number 2