A lower bound for the number of orientable triangular embeddings of some complete graphs
From MaRDI portal
Publication:965249
DOI10.1016/J.JCTB.2009.08.001zbMATH Open1222.05106OpenAlexW2078554428MaRDI QIDQ965249FDOQ965249
Martin Knor, Michael John Grannell
Publication date: 21 April 2010
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.2009.08.001
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)
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
- On biembeddings of Latin squares
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
- Recursive constructions for triangulations
- BIEMBEDDINGS OF LATIN SQUARES AND HAMILTONIAN DECOMPOSITIONS
- A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
- Triangular embeddings of complete graphs (neighborly maps) with 12 and 13 vertices
- A constraint on the biembedding of Latin squares
Cited In (20)
- A note on the directed genus of K_n,n,n and K_n
- On the minimal nonzero distance between triangular embeddings of a complete graph.
- Doubly even orientable closed 2-cell embeddings of the complete graph
- Coloring face hypergraphs on surfaces
- A simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) vertices
- On the number of triangular embeddings of complete graphs and complete tripartite graphs
- Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\)
- On the number of non-isomorphic (simple) \(k\)-gonal biembeddings of complete multipartite graphs
- Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs
- Quadrangular embeddings of complete graphs and the even map color theorem
- Generating nonisomorphic quadrangular embeddings of a complete graph
- A simple proof of the map color theorem for nonorientable surfaces
- Dihedral biembeddings and triangulations by complete and complete tripartite graphs
- A tripling construction for mutually orthogonal symmetric hamiltonian double Latin squares
- Face 2-colourable triangular embeddings of complete graphs
- Nonisomorphic complete triangulations of a surface
- Biembeddings of 2-rotational Steiner triple systems
- Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs
- A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s
- Self-embeddings of cyclic and projective Steiner quasigroups
Recommendations
- 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 👍 👎
- Title not available (Why is that?) 👍 👎
- On the number of nonisomorphic orientable regular embeddings of complete graphs 👍 👎
- Lower bounds on the number of triangles in a graph 👍 👎
- A simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) vertices 👍 👎
- Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness 👍 👎
- On the orientable regular embeddings of complete multipartite graphs 👍 👎
- A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: A lower bound for the number of orientable triangular embeddings of some complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q965249)
