Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph
From MaRDI portal
Publication:2853333
DOI10.1002/jgt.21697zbMath1273.05144OpenAlexW1538220519MaRDI QIDQ2853333
Publication date: 21 October 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21697
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 (3)
Minimal quadrangulations of surfaces ⋮ Doubly even orientable closed 2-cell embeddings of the complete graph ⋮ Quadrangular embeddings of complete graphs and the even map color theorem
Cites Work
- Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
- A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
- A lower bound for the number of orientable triangular embeddings of some complete graphs
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
- How to determine the maximum genus of a graph
- Exponential families of non-isomorphic triangulations of complete graphs
- On the number of nonisomorphic orientable regular embeddings of complete graphs
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
- Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments
- Recursive constructions for triangulations
- Hamiltonian embeddings from triangulations
- Determining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddings
This page was built for publication: Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph
