Pages that link to "Item:Q419374"
From MaRDI portal
The following pages link to Algorithms for the edge-width of an embedded graph (Q419374):
Displaying 7 items.
- Finding shortest non-separating and non-contractible cycles for topologically embedded graphs (Q878074) (← links)
- Embeddings of graphs with no short noncontractible cycles (Q916669) (← links)
- On the Wimer method for designing edge-based algorithms (Q1011875) (← links)
- Discrete systolic inequalities and decompositions of triangulated surfaces (Q2349858) (← links)
- Algorithms for graphs embeddable with few crossings per edge (Q2461632) (← links)
- Face-width of embedded graphs (Q2702745) (← links)
- Fundamentals of Computation Theory (Q5492943) (← links)