On the average genus of the random graph
From MaRDI portal
Publication:4843501
DOI10.1002/jgt.3190200102zbMath0840.05083OpenAlexW2080139790MaRDI QIDQ4843501
Publication date: 27 June 1996
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190200102
Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (9)
On the average crosscap number. II: Bounds for a graph ⋮ Bounds for the average genus of the vertex-amalgamation of graphs ⋮ Random 2-cell embeddings of multistars ⋮ Cubic graphs whose average number of regions is small ⋮ New bounds for the average genus and average number of faces of a simple graph ⋮ Expected number of faces in a random embedding of any graph is at most linear ⋮ The Genus of a Random Bipartite Graph ⋮ Remarks on the lower bounds for the average genus ⋮ Limits for embedding distributions
Cites Work
This page was built for publication: On the average genus of the random graph
