The following pages link to (Q3601569):
Displayed 14 items.
- Algorithms for the edge-width of an embedded graph (Q419374) (← links)
- Counting and sampling minimum cuts in genus \(g\) graphs (Q471138) (← links)
- Computing the shortest essential cycle (Q603870) (← links)
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding (Q834610) (← links)
- Splitting (complicated) surfaces is hard (Q934027) (← links)
- Topologically trivial closed walks in directed surface graphs (Q2223623) (← links)
- Toroidal grid minors and stretch in embedded graphs (Q2284733) (← links)
- Discrete systolic inequalities and decompositions of triangulated surfaces (Q2349858) (← links)
- Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168) (← links)
- (Q5088964) (← links)
- Approximating the Crossing Number of Toroidal Graphs (Q5387753) (← links)
- (Q5743478) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)
- Many distances in planar graphs (Q5920250) (← links)