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