Asymptotic enumeration of labelled graphs by genus
zbMATH Open1205.05013MaRDI QIDQ625375FDOQ625375
Authors: Edward A. Bender, Zhicheng Gao 
Publication date: 17 February 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/227897
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
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
Planar graphs; geometric and topological aspects of graph theory (05C10) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (11)
- Random graphs from a weighted minor-closed class
- Genus polynomials of ladder-like sequences of graphs
- Logical limit laws for minor-closed classes of graphs
- An asymptotics for the number of labelled planar tetracyclic and pentacyclic graphs
- On the sum of digits of some sequences of integers
- 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
- Cubic graphs and related triangulations on orientable surfaces
- Asymptotic enumeration and limit laws for graphs of fixed genus
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)
