The following pages link to (Q4232795):
Displaying 4 items.
- On the complexity of the approximation of nonplanarity parameters for cubic graphs (Q1827857) (← links)
- Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs (Q3104769) (← links)
- SPLITTING NUMBER is NP-complete (Q5928869) (← links)
- Parameterized complexity of vertex splitting to pathwidth at most 1 (Q6639742) (← links)