Counterexamples to the nonorientable genus conjecture for complete tripartite graphs

DOI10.1016/j.ejc.2004.01.009zbMath1060.05025OpenAlexW2087338417WikidataQ123252197 ScholiaQ123252197MaRDI QIDQ1767627

Chris Stephens, Xiaoya Zha, Mark N. Ellingham

Publication date: 8 March 2005

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2004.01.009

zbMATH Keywords

complete tripartite graphsnonorientable genusorientable genus

Mathematics Subject Classification ID

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

Related Items (5)

The nonorientable genus of joins of complete graphs with large edgeless graphs ⋮ Finite groups whose noncyclic graphs have positive genus ⋮ The nonorientable genus of complete tripartite graphs ⋮ Restricted matching in graphs of small genus ⋮ The orientable genus of some joins of complete graphs with large edgeless graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orientable and non orientable genus of the complete bipartite graph
• Genus embeddings for some complete tripartite graphs
• Triangulating a surface with a prescribed graph
• On the genus of joins and compositions of graphs
• Das Geschlecht des vollständigen paaren Graphen
• The nonorientable genus of complete tripartite graphs
• Das Geschlecht des vollständigen dreifärbbaren Graphen
• The graph genus problem is NP-complete
• Orientable and Nonorientable Genera for Some Complete Tripartite Graphs
• Der vollständige paare Graph auf nichtorientierbaren Flächen.
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• The genus of the complete tripartite graph Kmn,n,n

This page was built for publication: Counterexamples to the nonorientable genus conjecture for complete tripartite graphs