The genus of a random graph
DOI10.1016/0012-365X(95)00215-IzbMATH Open0834.05023OpenAlexW2078504643WikidataQ127109821 ScholiaQ127109821MaRDI QIDQ1896342FDOQ1896342
Authors: David A. Grable, Dan S. Archdeacon
Publication date: 8 April 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(95)00215-i
Recommendations
- On the genus of a random graph
- The genus of a random bipartite graph
- On the average genus of the random graph
- The genus of the Erdős-Rényi random graph and the fragile genus property
- The genus of the Erdős-Rényi random graph and the fragile genus property
- Random generations of the countable random graph
- Genus distribution for two classes of graphs
- Genus distributions for two classes of graphs
- Genus distribution for a graph
Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Near perfect coverings in graphs and hypergraphs
- Title not available (Why is that?)
- Asymptotic behavior of the chromatic index for hypergraphs
- The graph genus problem is NP-complete
- Title not available (Why is that?)
- Triangulating a surface with a prescribed graph
Cited In (13)
- Planarity and genus of sparse random bipartite graphs
- An Introduction to Random Topological Graph Theory
- The genus of the Erdős-Rényi random graph and the fragile genus property
- The genus of a random bipartite graph
- On the average genus of the random graph
- Randomly removing \(g\) handles at once
- Expected number of faces in a random embedding of any graph is at most linear
- Formation of a giant component in the intersection graph of a random chord diagram
- Classes of graphs embeddable in order-dependent surfaces
- On the genus of a random graph
- Genus from sandpile torsor algorithm
- The genus of a type of graph
- Triangulations and the Hajós conjecture
This page was built for publication: The genus of a random graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1896342)