The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices
From MaRDI portal
Publication:2662887
Recommendations
- Chromatic number of triangle-free graphs with some forbidden subgraphs
- Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree
- Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs
- scientific article; zbMATH DE number 6612443
- Induced subgraphs of graphs with large chromatic number. XIII. New brooms
Cites work
- 3-colorability and forbidden subgraphs. I: Characterizing pairs
- A bound on the chromatic number of graphs without certain induced subgraphs
- A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem
- Graph theory
- Graph Theory and Probability
- scientific article; zbMATH DE number 3747156 (Why is no real title available?)
- scientific article; zbMATH DE number 1286500 (Why is no real title available?)
- scientific article; zbMATH DE number 1833071 (Why is no real title available?)
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- Induced subtrees in graphs of large chromatic number
- On chromatic number of graphs and set-systems
- On Reed's conjecture about , and
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Radius two trees specify χ‐bounded classes
- Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \)
- Three-colourability and forbidden subgraphs. II: Polynomial algorithms
- Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree
- Vertex colouring and forbidden subgraphs -- a survey
Cited in
(7)- Chromatic number of triangle-free graphs with some forbidden subgraphs
- scientific article; zbMATH DE number 1833071 (Why is no real title available?)
- Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree
- scientific article; zbMATH DE number 5199085 (Why is no real title available?)
- Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs
- \( \chi \)-binding function for \((C_4, t\text{-broom}^+)\)-free graphs
- On P₅-free locally split graphs
This page was built for publication: The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2662887)
