Nonorientable biembeddings of cyclic Steiner triple systems generated by Skolem sequences

DOI10.1016/j.disc.2015.02.017zbMath1310.05028OpenAlexW2062996903MaRDI QIDQ2342621

Vladimir P. Korzhik

Publication date: 29 April 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.02.017

zbMATH Keywords

Steiner triple systemSkolem sequencecomplete graphtopological embedding

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Special sequences and polynomials (11B83) Triple systems (05B07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
• Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs
• Exponential families of non-isomorphic triangulations of complete graphs
• Nonorientable biembeddings of Steiner triple systems
• Recursive constructions for triangulations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nonorientable biembeddings of cyclic Steiner triple systems generated by Skolem sequences