Limit points for average genus. I: 3-connected and 2-connected simplicial graphs

DOI10.1016/0095-8956(92)90033-TzbMath0709.05017MaRDI QIDQ921011

Jonathan L. Gross, Jian'er Chen

Publication date: 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

average genus; graph imbedding; graph isomorphism testing

Mathematics Subject Classification ID

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

Related Items

Remarks on the lower bounds for the average genus, Cubic graphs whose average number of regions is small, Limit points for average genus. II: 2-connected non-simplicial graphs, Overlap matrices and total imbedding distributions, Algorithmic graph embeddings, Bounds for the average genus of the vertex-amalgamation of graphs, Stratified graphs for imbedding systems, Maximum genus and connectivity, A tight lower bound on the maximum genus of a simplicial graph, On the average genus of a graph, The total embedding distributions of cacti and necklaces

Cites Work

• Region distributions of graph embeddings and Stirling numbers
• Genus distributions for two classes of graphs
• Limit points for average genus. II: 2-connected non-simplicial graphs
• Kuratowski-type theorems for average genus
• Genus distributions for bouquets of circles
• On the average genus of a graph
• The graph genus problem is NP-complete
• Hierarchy for imbedding-distribution invariants of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item