Characterization of graphs with hall number 2

DOI10.1002/JGT.10154MaRDI QIDQ4458593zbMATHOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 1471060
• scientific article; zbMATH DE number 1792608
• scientific article; zbMATH DE number 638681
• Characterizations of \(H\)-graphs
• Publication:3470504
• Characterizing graphs with crossing number at least 2
• scientific article; zbMATH DE number 3906545
• Hall parameters of complete and complete bipartite graphs
• Characterizing all graphs with 2-exceptional edges
• A Characterization of Graphs of Diameter Two

Cites work

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

Cited in

(12)

• Extending Hall's theorem into list colorings: a partial history
• Restricted list coloring and Hall's condition
• Extremal jumps of the Hall number
• scientific article; zbMATH DE number 2188459 (Why is no real title available?)
• Completing partial proper colorings using Hall's condition
• List multicoloring problems involving the \(k\)-fold Hall numbers
• Refinements of Hall's condition
• scientific article; zbMATH DE number 1151851 (Why is no real title available?)
• Hall number for list colorings of graphs: Extremal results
• Hall numbers of some complete \(k\)-partite graphs
• Hall spectra and extending precolorings with extra colors
• Hall's theorem and extending partial Latinized rectangles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4458593)