Structural graph theory
July 10, 2020 EDT ccby-4.0 Graphs of bounded cliquewidth are polynomially -bounded
Graphs of bounded cliquewidth are polynomially-bounded
Bonamy, Marthe, and Michał Pilipczuk. 2020. “Graphs of Bounded Cliquewidth Are Polynomially <span Class="embedded-Math" Style="white-Space: Nowrap;">Χ</span>-Bounded.” Advances in Combinatorics, July. https://doi.org/10.19086/aic.13668.