Settling the genus of the \(n\)-prism

DOI10.1016/j.ejc.2022.103667OpenAlexW4313399501WikidataQ122662122 ScholiaQ122662122MaRDI QIDQ2700977

Timothy Sun

Publication date: 27 April 2023

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.02077

zbMATH Keywords

genus of a graphtriangular embeddings

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds
• The genus of \(K_n-K_2\)
• The genus of nearly complete graphs-case 6
• On the genus of the graph \(K_n\times K_2\) or the n-prism
• Exponential families of non-isomorphic triangulations of complete graphs
• Quadrangular embeddings of complete graphs and the even map color theorem
• Heffter arrays and biembedding graphs on surfaces
• A simple proof of the map color theorem for nonorientable surfaces
• Biembedding a Steiner Triple System With a Hamilton Cycle Decomposition of a Complete Graph
• Genus of cartesian products of regular bipartite graphs
• Surface embeddings of Steiner triple systems
• Simultaneous current graph constructions for minimum triangulations and complete graph embeddings
• The genus of K12s
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• Le problème des régions voisines sur les surfaces closes orientables
• The heawood map-coloring problem—Cases 1, 7, and 10
• Solution of the heawood map-coloring problem—Cases 3, 5, 6, and 9
• The Genus of Repeated Cartesian Products of Bipartite Graphs
• Face distributions of embeddings of complete graphs

This page was built for publication: Settling the genus of the \(n\)-prism