Graphs of bounded cliquewidth are polynomially $χ$-bounded

DOI10.19086/aic.13668zbMath1450.05072arXiv1910.00697OpenAlexW3040935456MaRDI QIDQ5126760

Michał Philipczuk, Marthe Bonamy

Publication date: 20 October 2020

Published in: Advances in Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.00697

zbMATH Keywords

hereditary class of graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (6)

Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs ⋮ Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Circle graphs are quadratically χ‐bounded ⋮ The grid theorem for vertex-minors ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure

This page was built for publication: Graphs of bounded cliquewidth are polynomially $χ$-bounded