The Genera of Amalgamations of Graphs
From MaRDI portal
Publication:5676232
DOI10.2307/1996687zbMATH Open0261.05104OpenAlexW4253944965MaRDI QIDQ5676232FDOQ5676232
Authors: Seth R. Alpert
Publication date: 1973
Full work available at URL: https://doi.org/10.2307/1996687
Cites Work
- Title not available (Why is that?)
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- Additivity of the genus of a graph
- Title not available (Why is that?)
- Solution of the heawood map-coloring problem—Cases 3, 5, 6, and 9
- Title not available (Why is that?)
- Orientable embedding of Cayley graphs
- Lösung des Problems der Nachbargebiete
- The heawood map-coloring problem—Cases 1, 7, and 10
- The Mapping of Graphs on Surfaces
- Title not available (Why is that?)
- The genus of K12s
- Solution of the Heawood map-coloring problem—case 11
- Title not available (Why is that?)
- Solution of the heawood map-coloring problem—Case 4
- Le problème des régions voisines sur les surfaces closes orientables
Cited In (6)
- An additivity theorem for the genus of a graph
- The Genera of Edge Amalgamations of Complete Bigraphs
- The thickness of amalgamations and Cartesian product of graphs
- Computing the genus of the 2-amalgamations of graphs
- Bounds for the average genus of the vertex-amalgamation of graphs
- On the Euler genus of a 2-connected graph
This page was built for publication: The Genera of Amalgamations of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5676232)