A note on the Gyárfás-Sumner conjecture
From MaRDI portal
Publication:6121918
DOI10.1007/s00373-024-02754-zarXiv2302.08922MaRDI QIDQ6121918
No author found.
Publication date: 26 March 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.08922
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Induced subtrees in graphs of large chromatic number
- Applications of hypergraph coloring to coloring graphs not inducing certain trees
- Induced subgraphs of graphs with large chromatic number. XIII. New brooms
- Radius two trees specify χ‐bounded classes
- Radius Three Trees in Graphs with Large Chromatic Number
- A survey of χ‐boundedness
- Induced subgraphs of graphs with large chromatic number. XII. Distant stars
- Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree
- Polynomial bounds for chromatic number. III. Excluding a double star
- Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path
This page was built for publication: A note on the Gyárfás-Sumner conjecture