On the average genus of a graph

DOI10.1007/BF02988301zbMath0777.05051MaRDI QIDQ2366954

Jonathan L. Gross, E. Ward Klein, Robert G. Rieper

Publication date: 11 August 1993

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

imbeddings; random variable; necklace; average genus

Mathematics Subject Classification ID

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

Related Items

Unnamed Item, Log-concavity of genus distributions of ring-like families of graphs, Remarks on the lower bounds for the average genus, Limit points for average genus. I: 3-connected and 2-connected simplicial graphs, Overlap matrices and total imbedding distributions, Lower bounds on the maximum genus of loopless multigraphs, Stratified graphs for imbedding systems, Maximum genus and connectivity, A tight lower bound on the maximum genus of a simplicial graph, The total embedding distributions of cacti and necklaces

Cites Work

• Region distributions of graph embeddings and Stirling numbers
• Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
• Genus distributions for two classes of graphs
• An upper bound for the average number of regions
• How to determine the maximum genus of a graph
• Genus distributions for bouquets of circles
• Hierarchy for imbedding-distribution invariants of a graph
• Enumerating 2-Cell Imbeddings of Connected Graphs
• Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item