Orientable and Nonorientable Genera for Some Complete Tripartite Graphs

DOI10.1137/S0895480103429319MaRDI QIDQ5317563zbMATH OpenOpenAlexFDO

Authors Ken-ichi Kawarabayashi, Chris Stephens, Xiaoya Zha

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)

Recommendations

• The nonorientable genus of complete tripartite graphs
• Counterexamples to the nonorientable genus conjecture for complete tripartite graphs
• On the orientable genus of graphs with bounded nonorientable genus
• On the orientable genus of the Cartesian product of a complete regular tripartite graph with an even cycle.
• Nonorientable genus of nearly complete bipartite graphs
• Settling the nonorientable genus of the nearly complete bipartite graphs
• The orientable genus of some joins of complete graphs with large edgeless graphs
• Triangulations of orientable surfaces by complete tripartite graphs
• On the genus of the complete tripartite graph \(K_{n, n, 1}\)
• On the number of genus embeddings of complete tripartite graph.

Cited in

(17)

• The orientable genus of some joins of complete graphs with large edgeless graphs
• Nonorientable genus of nearly complete bipartite graphs
• On the orientable genus of graphs with bounded nonorientable genus
• Counterexamples to the nonorientable genus conjecture for complete tripartite 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
• The nonorientable genus of complete tripartite graphs
• The nonorientable genus of joins of complete graphs with large edgeless graphs
• The genus of the balanced hypercube
• scientific article; zbMATH DE number 3939383 (Why is no real title available?)
• Nonorientable Hamilton cycle embeddings of complete tripartite graphs
• A note on the directed genus of \(K_{n,n,n}\) and \(K_n\)
• The orientable genus of the join of a cycle and a complete graph
• Topological Graph Theory: A Personal Account
• On the orientable genus of the Cartesian product of a complete regular tripartite graph with an even cycle.
• Orientable Hamilton cycle embeddings of complete tripartite graphs. II: Voltage graph constructions and applications
• On the genus of the complete tripartite graph \(K_{n, n, 1}\)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317563)