Wright's formulae for the number of connected sparsely edged graphs

DOI10.1002/jgt.3190010408zbMath0337.05120OpenAlexW2077477476MaRDI QIDQ4103561

N. A. Young, A. M. Murray, F. M. D. Gray

Publication date: 1977

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

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

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items

The number of sparsely edged labelled Hamiltonian graphs, Enumeration of smooth labelled graphs