An additivity theorem for maximum genus of a graph
From MaRDI portal
Publication:1244241
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)
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
This page was built for publication: An additivity theorem for maximum genus of a graph