-binding function for (C₄, t-broom^+)-free graphs
From MaRDI portal
Publication:6570047
Recommendations
- Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs
- Chromatic number of triangle-free graphs with some forbidden subgraphs
- Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree
- A Generalization of $$\chi $$-Binding Functions
- The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices
Cites work
- scientific article; zbMATH DE number 2186978 (Why is no real title available?)
- 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 3628985 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- Coloring the hypergraph of maximal cliques of a graph with no long path
- Graph Theory and Probability
- Graph classes with linear Ramsey numbers
- Graph theory with applications
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions
- Linearly \(\chi\)-bounding \((P_6,C_4)\)-free graphs
- Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs
- Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path
- Ramsey-type theorems
- Square-free graphs with no induced fork
- The strong perfect graph theorem
This page was built for publication: \( \chi \)-binding function for \((C_4, t\text{-broom}^+)\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570047)
