Characterization of graphs with hall number 2
From MaRDI portal
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
Cited in
(12)- Restricted list coloring and Hall's condition
- Completing partial proper colorings using Hall's condition
- Hall numbers of some complete k-partite graphs
- List multicoloring problems involving the k-fold Hall numbers
- Extremal jumps of the Hall number
- scientific article; zbMATH DE number 1151851 (Why is no real title available?)
- Hall's theorem and extending partial Latinized rectangles
- Hall spectra and extending precolorings with extra colors
- Refinements of Hall's condition
- scientific article; zbMATH DE number 2188459 (Why is no real title available?)
- Extending Hall's theorem into list colorings: a partial history
- Hall number for list colorings of graphs: Extremal results
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)