Pages that link to "Item:Q878074"
From MaRDI portal
The following pages link to Finding shortest non-separating and non-contractible cycles for topologically embedded graphs (Q878074):
Displaying 17 items.
- Algorithms for the edge-width of an embedded graph (Q419374) (← links)
- Space complexity of perfect matching in bounded genus bipartite graphs (Q439936) (← 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)
- Topologically trivial closed walks in directed surface graphs (Q2223623) (← links)
- Discrete systolic inequalities and decompositions of triangulated surfaces (Q2349858) (← links)
- Untangling two systems of noncrossing curves (Q2630858) (← links)
- Approximation Algorithms for Euler Genus and Related Problems (Q4581910) (← links)
- (Q5088964) (← links)
- Compressed Decision Problems in Hyperbolic Groups. (Q5090484) (← links)
- Approximating the Crossing Number of Toroidal Graphs (Q5387753) (← links)
- Dynamic programming for graphs on surfaces (Q5501962) (← links)
- (Q5743478) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)
- Three-coloring triangle-free graphs on surfaces. VI: 3-colorability of quadrangulations (Q6184892) (← links)
- Homomorphisms between graphs embedded in surfaces (Q6201918) (← links)