Polynomial bounds for chromatic number VI. Adding a four-vertex path
A hereditary class of graphs is χ-bounded if there is a function f such that every graph G in the class has chromatic number at most f(ω(G)), where ω(G) is the clique number of G; and the class is polynomially χ-bounded if f can be taken to be a polynomial. The Gyárfás–Sumner conjecture asserts that...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Elsevier
2023
|