Some problems in the enumeration of labelled graphs
From MaRDI portal
Publication:4196450
DOI10.1017/S0004972700011436zbMATH Open0409.05034MaRDI QIDQ4196450FDOQ4196450
Authors: Nicholas Wormald 
Publication date: 1980
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Cited In (12)
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs
- Analyzing local and global properties of multigraphs
- Depth first exploration of a configuration model
- Minimum vertex cover in generalized random graphs with power law degree distribution
- Discrepancy properties for random regular digraphs
- Asymptotic enumeration of digraphs and bipartite graphs by degree sequence
- An equation-free approach to coarse-graining the dynamics of networks
- Generation of networks with prescribed degree-dependent clustering
- Stable graphs: distributions and line-breaking construction
- Limit theorems for assortativity and clustering in null models for scale-free networks
- Threshold functions for small subgraphs in simple graphs and multigraphs
- How to determine if a random graph with a fixed degree sequence has a giant component
This page was built for publication: Some problems in the enumeration of labelled graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4196450)
