Pages that link to "Item:Q1325240"
From MaRDI portal
The following pages link to Triangulating a surface with a prescribed graph (Q1325240):
Displaying 12 items.
- Pairs of trees in tree--tree triangulations (Q878648) (← links)
- Embeddings of graphs (Q1313840) (← links)
- The genus problem for cubic graphs (Q1354116) (← links)
- Counterexamples to the nonorientable genus conjecture for complete tripartite graphs (Q1767627) (← links)
- Face covers and the genus problem for apex graphs (Q1850536) (← links)
- The genus of a random graph (Q1896342) (← links)
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete (Q1917249) (← links)
- Subhamiltonian toroidal graphs (Q2150522) (← links)
- Minimal quadrangulations of surfaces (Q2171020) (← links)
- Face-width of embedded graphs (Q2702745) (← links)
- Approximation Algorithms for Euler Genus and Related Problems (Q4581910) (← links)
- Existence of polyhedral embeddings of graphs (Q5955209) (← links)