New irrelevant-vertex theorem for (k,d)-Folio gives linkage function ℓ(k) bounded by 2^{poly(k)}.
Vertex cuts
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2verdicts
UNVERDICTED 2representative citing papers
A locally finite connected graph is r-locally chordal iff its canonical r-global decomposition is into cliques.
citing papers explorer
-
Optimal Bounds for the k-Disjoint Paths Problem
New irrelevant-vertex theorem for (k,d)-Folio gives linkage function ℓ(k) bounded by 2^{poly(k)}.
-
Canonical tree-decompositions of chordal graphs
A locally finite connected graph is r-locally chordal iff its canonical r-global decomposition is into cliques.