Constructing a minimum genus embedding of the complete tripartite graph K_n, n, 1 for odd n

DOI10.1016/J.DISC.2019.06.008MaRDI QIDQ2324490zbMATH OpenOpenAlexFDO

Authors Shengxiang Lv, Yichao Chen

Publication date 11 September 2019

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

complete bipartite graphcomplete tripartite graphembeddinggenus

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• On the genus of the complete tripartite graph \(K_{n, n, 1}\)
• Nonorientable Hamilton cycle embeddings of complete tripartite graphs
• Orientable Hamilton cycle embeddings of complete tripartite graphs. II: Voltage graph constructions and applications
• On the number of genus embeddings of complete tripartite graph.
• Minimum genus embeddings of the complete graph

Cites work

• Der vollständige paare Graph auf nichtorientierbaren Flächen.
• Genus embeddings for some complete tripartite graphs
• Graphs on surfaces
• On the genus of joins and compositions of graphs
• On the genus of the complete tripartite graph \(K_{n, n, 1}\)
• Orientable and non orientable genus of the complete bipartite graph
• Orientable and Nonorientable Genera for Some Complete Tripartite Graphs
• The nonorientable genus of complete tripartite graphs
• Topological graph theory.

Cited in

(3)

• Minimal quadrangulations of surfaces
• 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: Constructing a minimum genus embedding of the complete tripartite graph \(K_{n, n, 1}\) for odd \(n\)

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