Graphs of bounded cliquewidth are polynomially $χ$-bounded
Advances in Combinatorics · 2020
DOI: 10.19086/aic.13668 ↗At a glance
Journal article in Advances in Combinatorics, 2020. Written by Marthe Bonamy and 1 co-authors. Cited 1 times so far (Crossref).
Abstract (original language)
We prove that if $\mathcal{C}$ is a hereditary class of graphs that is polynomially $\chi$-bounded, then the class of graphs that admit decompositions into pieces belonging to $\mathcal{C}$ along cuts of bounded rank is also polynomially $\chi$-bounded. In particular, this implies that for every positive integer $k$, the class of graphs of cliquewidth at most $k$ is polynomially $\chi$-bounded.
Cite
APA
Bonamy, M., & Pilipczuk, M. (2020). Graphs of bounded cliquewidth are polynomially $χ$-bounded. Advances in Combinatorics. https://doi.org/10.19086/aic.13668
Vancouver
Bonamy M, Pilipczuk M. Graphs of bounded cliquewidth are polynomially $χ$-bounded. Advances in Combinatorics. 2020. doi:10.19086/aic.13668
BibTeX
@article{Bonamy2020,
author = {Bonamy, Marthe and Pilipczuk, Michał},
title = {Graphs of bounded cliquewidth are polynomially $χ$-bounded},
journal = {Advances in Combinatorics},
year = {2020},
doi = {10.19086/aic.13668}
}
EUVIMED