Triangular embeddings of K_n-K_m with unboundedly large m
From MaRDI portal
Publication:1584375
DOI10.1016/S0012-365X(98)00040-5zbMATH Open0958.05039OpenAlexW2192785107MaRDI QIDQ1584375FDOQ1584375
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00040-5
Recommendations
- scientific article
- A nonorientable triangular embedding of \(K_ n-K_ 2\), \(n\equiv 8\pmod{12}\)
- A simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) vertices
- Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs
- A simple construction of exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
Cites Work
Cited In (8)
- Biembedding a Steiner triple system with a Hamilton cycle decomposition of a complete graph
- The orientable genus of the join of a cycle and a complete graph
- The orientable genus of some joins of complete graphs with large edgeless graphs
- A nonorientable triangular embedding of \(K_ n-K_ 2\), \(n\equiv 8\pmod{12}\)
- The nonorientable genus of joins of complete graphs with large edgeless graphs
- Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs
- Title not available (Why is that?)
- Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs II: Voltage Graph Constructions and Applications
This page was built for publication: Triangular embeddings of \(K_n-K_m\) with unboundedly large \(m\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584375)
