An additivity theorem for maximum genus of a graph

DOI10.1016/0012-365X(78)90148-6zbMath0373.05030MaRDI QIDQ1244241

Charles H. C. Little, Richard D. Ringeisen

Publication date: 1978

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

Mathematics Subject Classification ID

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

Related Items (3)

Bounds for the average genus of the vertex-amalgamation of graphs ⋮ The construction and reduction of strong snarks ⋮ A tight lower bound on the maximum genus of a simplicial graph

Cites Work

• On the maximum genus of a graph
• A Kuratowski-type theorem for the maximum genus of a graph
• The Genus, Regional Number, and Betti Number of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An additivity theorem for maximum genus of a graph