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

DOI10.1016/J.JCTB.2005.09.006MaRDI QIDQ2490841zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the minimal nonzero distance between triangular embeddings of a complete graph.
• A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
• On the number of triangular embeddings of complete graphs and complete tripartite graphs
• A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs
• Triangular embeddings of complete graphs (neighborly maps) with 12 and 13 vertices

Cites work

• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 3756556 (Why is no real title available?)
• scientific article; zbMATH DE number 3450230 (Why is no real title available?)
• Exponential families of non-isomorphic triangulations of complete graphs
• Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
• On the minimal nonzero distance between triangular embeddings of a complete graph.
• On the number of nonisomorphic orientable regular embeddings of complete graphs
• Recursive constructions for triangulations

Cited in

(1)

• On the minimal nonzero distance between triangular embeddings of a complete graph.

This page was built for publication: On the maximal distance between triangular embeddings of a complete graph.

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