Treewidth versus clique number

Clément Dallard, Martin Milanič, Kenny Štorgel · 2024 · Journal of Combinatorial Theory Series B · DOI 10.1016/j.jctb.2023.10.006

1 Pith paper cite this work, alongside 18 external citations. Polarity classification is still indexing.

1 Pith paper citing it

18 external citations · OpenAlex

open at publisher browse 1 citing papers

representative citing papers

math.CO · 2026-07-15 · accept · novelty 7.0

For {P_s,K_{t,t}}-free graphs, the maximum path length is at most 2^{ω(G)^c}, and treedepth is clique-polynomial.

Showing 1 of 1 citing paper.

Excluding paths and bicliques math.CO · 2026-07-15 · accept · none · ref 12
For {P_s,K_{t,t}}-free graphs, the maximum path length is at most 2^{ω(G)^c}, and treedepth is clique-polynomial.