Pith. sign in

Title resolution pending

· 2021

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

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Finding d-Cuts in Claw-free Graphs

math.CO · 2025-05-23 · conditional · novelty 6.0

For every d≥2, d-Cut is constant-time solvable on claw-free graphs of maximum degree at most 2d+1 and NP-complete on those of degree at least 2d+3, leaving only degree 2d+2 open.

citing papers explorer

Showing 1 of 1 citing paper.

  • Finding d-Cuts in Claw-free Graphs math.CO · 2025-05-23 · conditional · none · ref 2

    For every d≥2, d-Cut is constant-time solvable on claw-free graphs of maximum degree at most 2d+1 and NP-complete on those of degree at least 2d+3, leaving only degree 2d+2 open.