The Genera of Amalgamations of Graphs

DOI10.2307/1996687zbMath0261.05104OpenAlexW4253944965MaRDI QIDQ5676232

Seth R. Alpert

Publication date: 1973

Full work available at URL: https://doi.org/10.2307/1996687

Mathematics Subject Classification ID

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

Related Items (6)

Computing the genus of the 2-amalgamations of graphs ⋮ The thickness of amalgamations and Cartesian product of graphs ⋮ An additivity theorem for the genus of a graph ⋮ Bounds for the average genus of the vertex-amalgamation of graphs ⋮ The Genera of Edge Amalgamations of Complete Bigraphs ⋮ On the Euler genus of a 2-connected graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lösung des Problems der Nachbargebiete
• Additivity of the genus of a graph
• The genus of K12s
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• Solution of the Heawood map-coloring problem—case 11
• Le problème des régions voisines sur les surfaces closes orientables
• Solution of the heawood map-coloring problem—Case 4
• The heawood map-coloring problem—Cases 1, 7, and 10
• Solution of the heawood map-coloring problem—Cases 3, 5, 6, and 9
• Orientable embedding of Cayley graphs
• The Mapping of Graphs on Surfaces

This page was built for publication: The Genera of Amalgamations of Graphs