Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
From MaRDI portal
Publication:598471
DOI10.1016/j.jctb.2004.02.002zbMath1048.05031MaRDI QIDQ598471
Vladimir P. Korzhik, Heinz-Juergen Voss
Publication date: 6 August 2004
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2004.02.002
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\), 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}\), Triangular embeddings of complete graphs from graceful labellings of paths, Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\), A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs, On the maximal distance between triangular embeddings of a complete graph., Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments
Cites Work
- Unnamed Item
- Unnamed Item
- Another proof of the map color theorem for nonorientable surfaces.
- Exponential families of non-isomorphic triangulations of complete graphs
- Generating the triangulations of the projective plane
- On the number of nonisomorphic orientable regular embeddings of complete graphs
- Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
- Tight and untight triangulations of surfaces by complete graphs
- The combinatorial map color theorem
- Recursive constructions for triangulations
- Nonisomorphic complete triangulations of a surface