Pith. sign in

Title resolution pending

Neil Robertson · 1983 · DOI 10.1016/0095-8956(83

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

math.CO 1

years

2026 1

verdicts

ACCEPT 1

representative citing papers

Excluding paths and bicliques

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Excluding paths and bicliques math.CO · 2026-07-15 · accept · none · ref 29

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