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.
The complexity of the P erfect M atching- C ut problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Finding d-Cuts in Claw-free Graphs
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.