pith. sign in

Title resolution pending

János Barát, David R · 2008

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

1 Pith paper citing it
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

CONDITIONAL 1

representative citing papers

Tree-partitions and small-spread tree-decompositions

math.CO · 2026-04-07 · conditional · novelty 7.0

Every graph of treewidth k and max degree Δ has a tree-partition of width O(kΔ) whose underlying tree has max degree O(Δ) and O(n/kΔ) vertices; domino treewidth is Θ(kΔ²) and a related spread-k bound is tight.

citing papers explorer

Showing 1 of 1 citing paper.

  • Tree-partitions and small-spread tree-decompositions math.CO · 2026-04-07 · conditional · none · ref 4

    Every graph of treewidth k and max degree Δ has a tree-partition of width O(kΔ) whose underlying tree has max degree O(Δ) and O(n/kΔ) vertices; domino treewidth is Θ(kΔ²) and a related spread-k bound is tight.