The following pages link to (Q5363778):
Displaying 6 items.
- Obstructions for partitioning into forests and outerplanar graphs (Q831856) (← links)
- Fixed-parameter tractable distances to sparse graph classes (Q2408199) (← links)
- Approximating the distance to properties in bounded-degree and general sparse graphs (Q4962788) (← links)
- Recovering sparse graphs (Q5005129) (← links)
- Parameterized Complexity of Elimination Distance to First-Order Logic Properties (Q5072610) (← links)
- Block elimination distance (Q5918777) (← links)