Recommendations
- Induced subgraphs of graphs with large chromatic number. VII: Gyárfás' complementation conjecture
- Induced subgraphs of graphs with large chromatic number. XII. Distant stars
- Extension of Gyárfás-Sumner conjecture to digraphs
- scientific article; zbMATH DE number 975418
- Cliques and stable sets in undirected graphs
Cites work
- scientific article; zbMATH DE number 3747156 (Why is no real title available?)
- scientific article; zbMATH DE number 3480625 (Why is no real title available?)
- scientific article; zbMATH DE number 3632548 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- A finite basis characterization of alpha-split colorings
- Excluding pairs of graphs
- Generalized split graphs and Ramsey numbers
- Graph Theory and Probability
- Tournaments and colouring
Cited in
(11)- Excluding pairs of graphs
- Some of my favorite coloring problems for graphs and digraphs
- Tree-width dichotomy
- Classes of graphs without star forests and related graphs
- Hereditary classes of graphs: a parametric approach
- Fractional cocoloring of graphs
- Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
- Excluding a substar and an antisubstar
- Graph classes with linear Ramsey numbers
- Ramsey numbers and graph parameters
This page was built for publication: Extending the Gyárfás-Sumner conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q401488)
