Genus embeddings of a type of graph

DOI10.1007/S12190-008-0077-9zbMath1148.05030OpenAlexW2078072472MaRDI QIDQ949340

Zeling Shao, Yanpei Liu

Publication date: 21 October 2008

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-008-0077-9

zbMATH Keywords

embeddinggenusorientable surfacejoint tree

Mathematics Subject Classification ID

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

Related Items (2)

The genus of a type of graph ⋮ Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\)

Cites Work

• Unnamed Item
• Unnamed Item
• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
• Exponentially many maximum genus embeddings and genus embeddings for complete graphs
• Orientable and non orientable genus of the complete bipartite graph
• Genus embeddings for some complete tripartite graphs
• Das Geschlecht des vollständigen paaren Graphen
• The graph genus problem is NP-complete
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM

This page was built for publication: Genus embeddings of a type of graph