Biembedding a Steiner Triple System With a Hamilton Cycle Decomposition of a Complete Graph

DOI10.1002/jgt.21774zbMath1302.05016OpenAlexW1635410918MaRDI QIDQ2922217

Thomas A. McCourt

Publication date: 9 October 2014

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

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

zbMATH Keywords

Steiner triple systemHamilton cycle decompositionbiembeddingnonorientable surfacecurrent graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Triple systems (05B07)

Related Items

Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs II: Voltage Graph Constructions and Applications, Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs, Settling the genus of the \(n\)-prism, The existence of square non-integer Heffter arrays, Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \), Heffter arrays and biembedding graphs on surfaces

Cites Work

• The topological theory of current graphs
• Triangular embeddings of \(K_n-K_m\) with unboundedly large \(m\)
• Maximum genus embeddings of Steiner triple systems
• Nonorientable biembeddings of Steiner triple systems
• The nonorientable genus of joins of complete graphs with large edgeless graphs