Face distributions of embeddings of complete graphs
From MaRDI portal
Publication:6055941
DOI10.1002/jgt.22655zbMath1521.05123arXiv1708.02092OpenAlexW3132911477MaRDI QIDQ6055941
Publication date: 29 September 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.02092
Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Edge‐maximal graphs on orientable and some nonorientable surfaces, The connectivity of the dual, Settling the genus of the \(n\)-prism
Cites Work
- A minimum-vertex triangulation
- The genus of \(K_n-K_2\)
- The genus of nearly complete graphs-case 6
- How to determine the maximum genus of a graph
- Three nonisomorphic triangulations of an orientable surface with the same complete graph
- Another proof of the map color theorem for nonorientable surfaces.
- Exponential families of non-isomorphic triangulations of complete graphs
- On the number of nonisomorphic orientable regular embeddings of complete graphs
- Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
- Triangular embeddings of complete graphs from graceful labellings of paths
- On the maximum genus of a graph
- Hierarchy for imbedding-distribution invariants of a graph
- Generalized Embedding Schemes
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- Solution of the Heawood map-coloring problem—case 11
- Le problème des régions voisines sur les surfaces closes orientables
- Solution of the heawood map-coloring problem—Cases 3, 5, 6, and 9
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
