Problemresearch
Bounded degree deletion
Also called d-degree deletion.
Delete at most k vertices so that every remaining vertex has degree at most d; FPT.
Delete at most k vertices so that every remaining vertex has degree at most d; FPT.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag CXX2BJ Edit this page History Report an error