Nonorientable Hamilton cycle embeddings of complete tripartite graphs

DOI10.1016/J.DISC.2012.02.012MaRDI QIDQ427835zbMATH OpenOpenAlexFDO

Authors Justin Z. Schroeder, M. N. Ellingham

Publication date 18 June 2012

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

graph embeddingHamilton cyclenonorientable genuscomplete tripartite graph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Orientable Hamilton cycle embeddings of complete tripartite graphs. II: Voltage graph constructions and applications
• Orientable Hamilton cycle embeddings of complete tripartite graphs. I: Latin square constructions
• Hamilton surfaces for the complete symmetric tripartite graph
• Hamiltonian embeddings from triangulations
• Biembedding a Steiner triple system with a Hamilton cycle decomposition of a complete graph

Cites work

• scientific article; zbMATH DE number 3939383 (Why is no real title available?)
• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 3596880 (Why is no real title available?)
• (m)-covering of a triangulation
• Constructing a covering triangulation by means of a nowhere-zero dual flow
• Das Geschlecht des vollständigen dreifärbbaren Graphen
• Der vollständige paare Graph auf nichtorientierbaren Flächen.
• Graphs on surfaces
• Hamiltonian embeddings from triangulations
• Minimal ordered triangulations of surfaces
• Orientable and Nonorientable Genera for Some Complete Tripartite Graphs
• Orientable and non orientable genus of the complete bipartite graph
• The nonorientable genus of complete tripartite graphs
• The nonorientable genus of joins of complete graphs with large edgeless graphs
• The orientable genus of some joins of complete graphs with large edgeless graphs

Cited in

(9)

• Constructing a minimum genus embedding of the complete tripartite graph \(K_{n, n, 1}\) for odd \(n\)
• Orientable Hamilton cycle embeddings of complete tripartite graphs. I: Latin square constructions
• scientific article; zbMATH DE number 841626 (Why is no real title available?)
• Orientable Hamilton cycle embeddings of complete tripartite graphs. II: Voltage graph constructions and applications
• Finite groups whose noncyclic graphs have positive genus
• The nonorientable genus of complete tripartite graphs
• Hamilton surfaces for the complete symmetric tripartite graph
• Biembedding a Steiner triple system with a Hamilton cycle decomposition of a complete graph
• Hamiltonian embeddings from triangulations

This page was built for publication: Nonorientable Hamilton cycle embeddings of complete tripartite graphs

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