On the maximal distance between triangular embeddings of a complete graph.

DOI10.1016/j.jctb.2005.09.006zbMath1092.05017OpenAlexW2066945130MaRDI QIDQ2490841

Vladimir P. Korzhik

Publication date: 18 May 2006

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.2005.09.006

zbMATH Keywords

complete graphtriangular embeddingtopological embeddingsnonisomorphic embeddings

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
• On the minimal nonzero distance between triangular embeddings of a complete graph.
• Exponential families of non-isomorphic triangulations of complete graphs
• On the number of nonisomorphic orientable regular embeddings of complete graphs
• Recursive constructions for triangulations