The number of connected sparsely edged graphs. IV large nonseparable graphs

DOI10.1002/jgt.3190070211zbMath0478.05051OpenAlexW2042301440MaRDI QIDQ3934425

E. M. Wright

Publication date: 1983

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

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

zbMATH Keywords

2-connected graphs on n labelled points and q lines

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Connectivity (05C40)

Related Items (5)

On the enumeration of labeled series-parallel $k$-cyclic $2$-connected graphs ⋮ Asymptotic enumeration of labeled series-parallel $k$-cyclic bridgeless graphs ⋮ On the asymptotic enumeration of labeled connected \(k\)-cyclic graphs without bridges ⋮ Counting Connected Hypergraphs via the Probabilistic Method ⋮ Asymptotic enumeration of sparse 2-connected graphs

This page was built for publication: The number of connected sparsely edged graphs. IV large nonseparable graphs