On the genus of joins and compositions of graphs

DOI10.1016/S0012-365X(97)81815-8zbMath0888.05021MaRDI QIDQ1377861

David L. Craft

Publication date: 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

joingenusimbeddingcomposition graph

Mathematics Subject Classification ID

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

Related Items (11)

The nonorientable genus of joins of complete graphs with large edgeless graphs ⋮ Minimal quadrangulations of surfaces ⋮ Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs ⋮ Rings whose total graphs have genus at most one ⋮ Counterexamples to the nonorientable genus conjecture for complete tripartite graphs ⋮ The nonorientable genus of complete tripartite graphs ⋮ On the genus of the complete tripartite graph \(K_{n, n, 1}\) ⋮ The orientable genus of some joins of complete graphs with large edgeless graphs ⋮ The orientable genus of the join of a cycle and a complete graph ⋮ Constructing a minimum genus embedding of the complete tripartite graph \(K_{n, n, 1}\) for odd \(n\) ⋮ Quadrangular embeddings of complete graphs and the even map color theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• The genus of the symmetric quadripartite graph
• Decomposition of the complete directed graph into k-circuits
• Das Geschlecht des vollständigen paaren Graphen
• On the genus of the composition of two graphs
• The embeddings of a graph—A survey
• Additivity of the genus of a graph

This page was built for publication: On the genus of joins and compositions of graphs