Geodesic
Graphs of bounded cliquewidth are polynomially $χ$-bounded
Advances in Combinatorics (2020)
Cet article a éte moissonné depuis la source Scholastica

Voir la notice de l'article

We prove that if $\mathcal{C}$ is a hereditary class of graphs that is polynomially $χ$-bounded, then the class of graphs that admit decompositions into pieces belonging to $\mathcal{C}$ along cuts of bounded rank is also polynomially $χ$-bounded. In particular, this implies that for every positive integer $k$, the class of graphs of cliquewidth at most $k$ is polynomially $χ$-bounded.
Publié le : 
@article{ADVC_2020_a3,
     author = {Marthe Bonamy and Micha{\l} Pilipczuk},
     title = {Graphs of bounded cliquewidth are polynomially $\ensuremath{\chi}$-bounded},
     journal = {Advances in Combinatorics},
     year = {2020},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ADVC_2020_a3/}
}
TY  - JOUR
AU  - Marthe Bonamy
AU  - Michał Pilipczuk
TI  - Graphs of bounded cliquewidth are polynomially $χ$-bounded
JO  - Advances in Combinatorics
PY  - 2020
UR  - http://geodesic.mathdoc.fr/item/ADVC_2020_a3/
LA  - en
ID  - ADVC_2020_a3
ER  - 
%0 Journal Article
%A Marthe Bonamy
%A Michał Pilipczuk
%T Graphs of bounded cliquewidth are polynomially $χ$-bounded
%J Advances in Combinatorics
%D 2020
%U http://geodesic.mathdoc.fr/item/ADVC_2020_a3/
%G en
%F ADVC_2020_a3
Marthe Bonamy; Michał Pilipczuk. Graphs of bounded cliquewidth are polynomially $χ$-bounded. Advances in Combinatorics (2020). http://geodesic.mathdoc.fr/item/ADVC_2020_a3/