On the number of triangular embeddings of complete graphs and complete tripartite graphs

DOI10.1002/JGT.20590MaRDI QIDQ2891048zbMATH OpenOpenAlexFDO

Authors Michael John Grannell, Martin Knor

Publication date 13 June 2012

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20590

zbMATH Keywords

complete graphcomplete tripartite graphLatin squaretriangular embedding

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• 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
• Face 2-colourable triangular embeddings of complete graphs
• Exponential families of non-isomorphic triangulations of complete graphs
• A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs

Cites work

• A lower bound for the number of orientable triangular embeddings of some complete graphs
• A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
• Biembeddings of Abelian groups
• BIEMBEDDINGS OF LATIN SQUARES AND HAMILTONIAN DECOMPOSITIONS
• Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
• Exponential families of non-isomorphic triangulations of complete graphs
• Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
• Nonorientable biembeddings of Steiner triple systems
• On biembeddings of Latin squares
• On the number of nonisomorphic orientable regular embeddings of complete graphs
• Recursive constructions for triangulations
• Regular Hamiltonian embeddings of \(K_{n,n}\) and regular triangular embeddings of \(K_{n,n,n}\).

Cited in

(15)

• On the number of acute triangles in a straight-line embedding of a maximal planar graph
• A simple construction for orientable triangular embeddings of the complete graphs on 12 s vertices
• 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.
• Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs
• A simple proof of the map color theorem for nonorientable surfaces
• Some triangulated surfaces without balanced splitting
• A simple construction of exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
• On the Number of Triangles Contained in Certain Graphs
• On the number of non-isomorphic (simple) \(k\)-gonal biembeddings of complete multipartite graphs
• The number of nonisomorphic nonorientable 6-gonal embeddings of complete graphs
• The variety of triangular embeddings of a graph in the projective plane
• Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs
• 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

This page was built for publication: On the number of triangular embeddings of complete graphs and complete tripartite graphs

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