Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness

DOI10.1016/j.disc.2007.06.023zbMath1152.05024OpenAlexW2038251093MaRDI QIDQ932590

Vladimir P. Korzhik, Jin Ho Kwok

Publication date: 11 July 2008

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

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

zbMATH Keywords

Steiner triple systemcomplete graphtopological embeddingtriangular embeddinglooseness

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Face 2-colourable triangular embeddings of complete graphs
• Three nonisomorphic triangulations of an orientable surface with the same complete graph
• Upper chromatic number of Steiner triple and quadruple systems
• Tight and untight triangulations of surfaces by complete graphs
• Embeddings of Steiner triple systems
• The nonorientable genus of joins of complete graphs with large edgeless graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness