Asymptotic enumeration of labelled graphs by genus
From MaRDI portal
Publication:625375
Recommendations
- Asymptotic enumeration and limit laws for graphs of fixed genus
- scientific article; zbMATH DE number 892539
- The asymptotic number of rooted maps on a surface. II: Enumeration by vertices and faces
- The asymptotic number of rooted 2-connected triangular maps on a surface
- The asymptotic number of labeled connected graphs with a given number of vertices and edges
Cited in
(12)- An asymptotics for the number of labelled planar tetracyclic and pentacyclic graphs
- On the sum of digits of some sequences of integers
- Cubic graphs and related triangulations on orientable surfaces
- Genus polynomials of ladder-like sequences of graphs
- Random graphs from a weighted minor-closed class
- The genus distribution of cubic graphs and asymptotic number of rooted cubic maps with high genus
- Logical limit laws for minor-closed classes of graphs
- Asymptotic enumeration and limit laws for graphs of fixed genus
- Enumeration of cubic multigraphs on orientable surfaces
- Graph classes with given 3-connected components: asymptotic enumeration and random graphs
- Classes of graphs embeddable in order-dependent surfaces
- The number of labeled 2-connected planar graphs
This page was built for publication: Asymptotic enumeration of labelled graphs by genus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625375)