Generalizing the duality theorem of graph embeddings
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 867699
- scientific article; zbMATH DE number 4164896
- scientific article; zbMATH DE number 51713
- Embeddings of graphs
- Self‐dual embeddings of complete multipartite graphs
- scientific article; zbMATH DE number 4126319
- scientific article; zbMATH DE number 4185639
- Publication:4722086
- General theoretical results on rectilinear embeddability of graphs
- Dualizability of graphs
Cites work
- scientific article; zbMATH DE number 3815669 (Why is no real title available?)
- scientific article; zbMATH DE number 3588683 (Why is no real title available?)
- A duality theorem for graph embeddings
- Constructing a covering triangulation by means of a nowhere-zero dual flow
- Constructions of covering triangulations with folds
- Dual imbeddings and wrapped quasi-coverings of graphs
- Embeddings of bipartite graphs
- Generalized Embedding Schemes
- Genus embeddings for some complete tripartite graphs
- The non-orientable genus of the n-cube
Cited in
(5)
This page was built for publication: Generalizing the duality theorem of graph embeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1263592)