Generating nonisomorphic quadrangular embeddings of a complete graph
From MaRDI portal
Publication:2853333
DOI10.1002/JGT.21697zbMATH Open1273.05144OpenAlexW1538220519MaRDI QIDQ2853333FDOQ2853333
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
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- 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
- Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
- Recursive constructions for triangulations
- 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
- Hamiltonian embeddings from triangulations
- Determining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddings
- Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments
Cited In (6)
- Doubly even orientable closed 2-cell embeddings of the complete graph
- On the number of non-isomorphic (simple) \(k\)-gonal biembeddings of complete multipartite graphs
- Quadrangular embeddings of complete graphs and the even map color theorem
- A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
- Minimal quadrangulations of surfaces
- Title not available (Why is that?)
This page was built for publication: Generating nonisomorphic quadrangular embeddings of a complete graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2853333)
