The number of connected sparsely edged graphs. II. Smooth graphs and blocks

DOI10.1002/jgt.3190020403zbMath0367.05042OpenAlexW2056914622MaRDI QIDQ4143336

E. M. Wright

Publication date: 1978

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190020403

zbMATH Keywords

BLOCKSNUMBER OF CONNECTED SPARSELY EDGED GRAPHSSMOOTH GRAPHS

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (19)

Forbidden subgraphs in connected graphs ⋮ On enumeration of labelled connected graphs by the number of cutpoints ⋮ The number of connected sparsely edged uniform hypergraphs ⋮ Birth and growth of multicyclic components in random hypergraphs ⋮ Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings ⋮ Unnamed Item ⋮ Counting Connected Hypergraphs via the Probabilistic Method ⋮ Enumeration of labeled connected bicyclic and tricyclic graphs without bridges ⋮ Enumeration of labeled outerplanar bicyclic and tricyclic graphs ⋮ Enumerating simplicial decompositions of surfaces with boundaries ⋮ THE NUMBER OF LABELED TETRACYCLIC SERIES-PARALLEL BLOCKS ⋮ Combinatorial study of graphs arising from the Sachdev-Ye-Kitaev model ⋮ Counting connected graphs inside-out ⋮ Double scaling in tensor models with a quartic interaction ⋮ The number of sparsely edged labelled Hamiltonian graphs ⋮ Enumeration of smooth labelled graphs ⋮ Asymptotic enumeration of sparse 2-connected graphs ⋮ Patchworks and metablocks enumeration ⋮ Spanning trees in random series-parallel graphs

This page was built for publication: The number of connected sparsely edged graphs. II. Smooth graphs and blocks