Orientable and Nonorientable Genera for Some Complete Tripartite Graphs

DOI10.1137/S0895480103429319zbMath1069.05026OpenAlexW2059489296MaRDI QIDQ5317563

Xiaoya Zha, Ken-ichi Kawarabayashi, Chris Stephens

Publication date: 16 September 2005

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

Full work available at URL: https://doi.org/10.1137/s0895480103429319

zbMATH Keywords

nonorientable genusorientable genus

Mathematics Subject Classification ID

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

Related Items (10)

Topological Graph Theory: A Personal Account ⋮ The nonorientable genus of joins of complete graphs with large edgeless graphs ⋮ Nonorientable Hamilton cycle embeddings of complete tripartite graphs ⋮ Counterexamples to the nonorientable genus conjecture for complete tripartite graphs ⋮ The nonorientable genus of complete tripartite graphs ⋮ The genus of the balanced hypercube ⋮ On the genus of the complete tripartite graph \(K_{n, n, 1}\) ⋮ The orientable genus of some joins of complete graphs with large edgeless graphs ⋮ Constructing a minimum genus embedding of the complete tripartite graph \(K_{n, n, 1}\) for odd \(n\) ⋮ Quadrangular embeddings of complete graphs and the even map color theorem

This page was built for publication: Orientable and Nonorientable Genera for Some Complete Tripartite Graphs