The nonorientable genus of joins of complete graphs with large edgeless graphs

DOI10.1016/j.jctb.2007.02.001zbMath1122.05028OpenAlexW2060395153MaRDI QIDQ2642016

D. Christopher Stephens, Mark N. Ellingham

Publication date: 20 August 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2007.02.001

zbMATH Keywords

joingenuscomplete graphnonorientable genus

Mathematics Subject Classification ID

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

Related Items

Face 2-Colorable Embeddings with Faces of Specified Lengths ⋮ Biembedding a Steiner Triple System With a Hamilton Cycle Decomposition of a Complete Graph ⋮ Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs II: Voltage Graph Constructions and Applications ⋮ The nonorientable genus of the join of two cycles ⋮ Doubly even orientable closed 2-cell embeddings of the complete graph ⋮ Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs ⋮ Nonorientable Hamilton cycle embeddings of complete tripartite graphs ⋮ Nilpotent graphs with crosscap at most two ⋮ Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness ⋮ Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs I: Latin Square Constructions ⋮ Coloring vertices and faces of maps on surfaces ⋮ The nonorientable genus of complete tripartite graphs ⋮ Biembeddings of symmetric \(n\)-cycle systems ⋮ The orientable genus of some joins of complete graphs with large edgeless graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The orientable genus of some joins of complete graphs with large edgeless graphs
• Minimal triangulations on orientable surfaces
• Orientable and non orientable genus of the complete bipartite graph
• The genus of \(K_n-K_2\)
• Triangular imbedding of \(K_n-K_6\)
• On the genus of joins and compositions of graphs
• Orientable triangular embeddings of K\(_{18}\)-K\(_3\) and K\(_{13}\)-K\(_3\)
• Another proof of the map color theorem for nonorientable surfaces.
• Triangular embeddings of \(K_n-K_m\) with unboundedly large \(m\)
• Counterexamples to the nonorientable genus conjecture for complete tripartite graphs
• A nonorientable triangular embedding of \(K_ n-K_ 2\), \(n\equiv 8\pmod{12}\)
• The nonorientable genus of complete tripartite graphs
• A smooth and unified proof of cases 6, 5 and 3 of the Ringel-Youngs theorem
• Minimal ordered triangulations of surfaces
• Orientable and Nonorientable Genera for Some Complete Tripartite Graphs
• Der vollständige paare Graph auf nichtorientierbaren Flächen.
• Bestimmung der Maximalzahl der Nachbargebiete auf nicht-orientierbaren Flächen