A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs

DOI10.1016/J.DISC.2007.03.060zbMATH Open1137.05023OpenAlexW2022606122MaRDI QIDQ2469983FDOQ2469983

Authors: Vladimir P. Korzhik, Jin Ho Kwak 

Publication date: 11 February 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.060

Recommendations

• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
• Exponential families of non-isomorphic triangulations of complete graphs
• Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs
• A simple construction of exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
• On the number of triangular embeddings of complete graphs and complete tripartite graphs

zbMATH Keywords

Steiner systemcomplete graphcurrent graphnonorientable surfacetriangular embeddingnonisomorphic embeddings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Triple systems (05B07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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.
• Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
• Recursive constructions for triangulations

Cited In (15)

• Title not available (Why is that?)
• Nonorientable biembeddings of Steiner triple systems
• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
• A simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) vertices
• On the maximal distance between triangular embeddings of a complete graph.
• Recursive constructions for triangulations
• Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
• Triangular embeddings of complete graphs (neighborly maps) with 12 and 13 vertices
• Face 2-colourable triangular embeddings of complete graphs
• Exponential families of non-isomorphic triangulations of complete 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}\)
• Nonisomorphic complete triangulations of a surface
• Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness
• Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.

This page was built for publication: A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2469983)