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

DOI10.1016/j.disc.2007.03.060zbMath1137.05023OpenAlexW2022606122MaRDI QIDQ2469983

Vladimir P. Korzhik, Jin Ho Kwok

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

zbMATH Keywords

Steiner systemcomplete graphnonorientable surfacecurrent graphtriangular embeddingnonisomorphic embeddings

Mathematics Subject Classification ID

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

Cites Work

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

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