Publication:3831035
From MaRDI portal
zbMath0676.05046MaRDI QIDQ3831035
Publication date: 1987
05C30: Enumeration in graph theory
41A60: Asymptotic approximations, asymptotic expansions (steepest descent, etc.)
Related Items
The probability of unusually large components in the near-critical Erdős–Rényi graph, Enumeration of labeled, connected, homeomorphically irreducible graphs, Forbidden subgraphs in connected graphs, On the asymptotic enumeration of labeled connected \(k\)-cyclic graphs without bridges, Enumeration of labeled connected graphs with given order and size