Cubic graphs whose average number of regions is small

DOI10.1016/0012-365X(95)00089-FzbMath0859.05040MaRDI QIDQ1126220

Clay Mauk, Saul Stahl

Publication date: 7 April 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

imbeddingconnected cubic graphaverage number of regionslogarithmic bound

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Permutation-partition pairs. III: Embedding distributions of linear families of graphs
• An upper bound for the average number of regions
• On the average genus of the random graph

This page was built for publication: Cubic graphs whose average number of regions is small