Nonorientable Hamilton cycle embeddings of complete tripartite graphs

DOI10.1016/j.disc.2012.02.012zbMath1243.05139OpenAlexW2167134090MaRDI QIDQ427835

Justin Z. Schroeder, Mark 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

Hamilton cyclegraph embeddingnonorientable genuscomplete tripartite graph

Mathematics Subject Classification ID

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

Related Items (2)

Finite groups whose noncyclic graphs have positive genus ⋮ Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs I: Latin Square Constructions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The orientable genus of some joins of complete graphs with large edgeless graphs
• (m)-covering of a triangulation
• Constructing a covering triangulation by means of a nowhere-zero dual flow
• Orientable and non orientable genus of the complete bipartite graph
• The nonorientable genus of complete tripartite graphs
• Das Geschlecht des vollständigen dreifärbbaren Graphen
• The nonorientable genus of joins of complete graphs with large edgeless graphs
• Minimal ordered triangulations of surfaces
• Hamiltonian embeddings from triangulations
• Orientable and Nonorientable Genera for Some Complete Tripartite Graphs
• Der vollständige paare Graph auf nichtorientierbaren Flächen.

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