The following pages link to (Q2934606):
Displayed 13 items.
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Spanning closed walks and TSP in 3-connected planar graphs (Q462924) (← links)
- Counting and sampling minimum cuts in genus \(g\) graphs (Q471138) (← links)
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
- Computing the shortest essential cycle (Q603870) (← links)
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph (Q1696548) (← links)
- On the excluded minor structure theorem for graphs of large tree-width (Q1931397) (← links)
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs (Q1945700) (← links)
- (Q5743426) (← links)
- (Q5743429) (← links)
- (Q5743478) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)