The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices
From MaRDI portal
Publication:2662887
DOI10.1007/s00010-020-00760-zzbMath1461.05095OpenAlexW3095512288MaRDI QIDQ2662887
Naoki Matsumoto, Minako Tanaka
Publication date: 15 April 2021
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00010-020-00760-z
Cites Work
- Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree
- Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \)
- A bound on the chromatic number of graphs without certain induced subgraphs
- Induced subtrees in graphs of large chromatic number
- 3-colorability and forbidden subgraphs. I: Characterizing pairs
- Three-colourability and forbidden subgraphs. II: Polynomial algorithms
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem
- Vertex colouring and forbidden subgraphs -- a survey
- Graph Theory
- Graph Theory and Probability
- Radius two trees specify χ‐bounded classes
- On chromatic number of graphs and set-systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices
