Bounds for the average genus of the vertex-amalgamation of graphs
From MaRDI portal
Publication:1896359
DOI10.1016/0012-365X(93)E0221-OzbMath0828.05025MaRDI QIDQ1896359
Publication date: 11 December 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (4)
On the average crosscap number. II: Bounds for a graph ⋮ Genus distribution of \(P_3 \mathop\square P_n\) ⋮ Remarks on the lower bounds for the average genus ⋮ The average genus for bouquets of circles and dipoles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Region distributions of some small diameter graphs
- Region distributions of graph embeddings and Stirling numbers
- Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
- Permutation-partition pairs. III: Embedding distributions of linear families of graphs
- An upper bound for the average number of regions
- Limit points for average genus. II: 2-connected non-simplicial graphs
- Kuratowski-type theorems for average genus
- An additivity theorem for maximum genus of a graph
- A Kuratowski-type theorem for the maximum genus of a graph
- The genus of the 2-amalgamations of graphs
- The orientable genus is nonadditive
- Hierarchy for imbedding-distribution invariants of a graph
- Permutation-Partition Pairs: A Combinatorial Generalization of Graph Embeddings
- Permutation-Partition Pairs II: Bounds on the Genus of the Amalgamation of Graphs
- Lower bounds for the average genus
- On the average genus of the random graph
- Additivity of the genus of a graph
- The Genera of Amalgamations of Graphs
This page was built for publication: Bounds for the average genus of the vertex-amalgamation of graphs
