An Introduction to Random Topological Graph Theory
From MaRDI portal
Recommendations
Cites work
- An upper bound for the average number of regions
- Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
- Enumerating 2-Cell Imbeddings of Connected Graphs
- Genus distributions for bouquets of circles
- Genus distributions for two classes of graphs
- Hierarchy for imbedding-distribution invariants of a graph
- scientific article; zbMATH DE number 3645098 (Why is no real title available?)
- On the genus of finite abelian groups
- Permutation-partition pairs. III: Embedding distributions of linear families of graphs
- Region distributions of graph embeddings and Stirling numbers
- Region distributions of some small diameter graphs
Cited in
(15)- Random Cayley maps for groups generated by involutions
- Limits for embedding distributions
- Random finite topologies and their thresholds
- The average genus for bouquets of circles and dipoles
- scientific article; zbMATH DE number 4095487 (Why is no real title available?)
- scientific article; zbMATH DE number 19224 (Why is no real title available?)
- On the genus of a random graph
- Uniform random colored complexes
- Random 2-cell embeddings of multistars
- 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 expected genus of a random chord diagram
- Asymptotics of local face distributions and the face distribution of the complete graph
- Strong log-convexity of genus sequences
- Pre-signed graphs: a reformulation of signed graphs and their embeddings
This page was built for publication: An Introduction to Random Topological Graph Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4325336)