Separating polyno- mialχ-boundedness fromχ-boundedness.Combinatorica, 44(1):1–8, 2024

Marcin Briański, James Davies, Bartosz Walczak · 2024 · COMBINATORICA · DOI 10.1007/s00493-023-00054-3

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

1 Pith paper citing it

14 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 6
For {P_s,K_{t,t}}-free graphs, the maximum path length is at most 2^{ω(G)^c}, and treedepth is clique-polynomial.