An additivity theorem for maximum genus of a graph

DOI10.1016/0012-365X(78)90148-6MaRDI QIDQ1244241zbMATH OpenFDO

Authors C. H. C. Little, Richard D. Ringeisen

Publication date 1978

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(78)90148-6

Mathematics Subject Classification ID

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

Cites work

• A Kuratowski-type theorem for the maximum genus of a graph
• scientific article; zbMATH DE number 3537700 (Why is no real title available?)
• scientific article; zbMATH DE number 3641446 (Why is no real title available?)
• scientific article; zbMATH DE number 3402645 (Why is no real title available?)
• On the maximum genus of a graph
• The Genus, Regional Number, and Betti Number of a Graph

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1244241)