A duality theorem for graph embeddings
From MaRDI portal
Publication:3856785
Cited in
(7)- Interview with Tomaž Pisanski
- Constructing a covering triangulation by means of a nowhere-zero dual flow
- New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces
- Steiner triple systems, pinched surfaces, and complete multigraphs
- Generalizing the duality theorem of graph embeddings
- Dual imbeddings and wrapped quasi-coverings of graphs
- The medial graph and voltage-current duality
This page was built for publication: A duality theorem for graph embeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3856785)