Pages that link to "Item:Q426901"
From MaRDI portal
The following pages link to Improved upper bounds for planarization and series-parallelization of degree-bounded graphs (Q426901):
Displaying 5 items.
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- A faster polynomial-space algorithm for Max 2-CSP (Q899585) (← links)
- Planarization and fragmentability of some classes of graphs (Q2427499) (← links)
- $K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs (Q3130446) (← links)
- (Q5396750) (← links)