Counting the 10‐point graphs by partition

R. C. Read, N. C. Wormald

Research output: Contribution to journalArticleResearchpeer-review

3 Citations (Scopus)


In this paper we discuss old and new theoretical methods for computing the number of graphs with a given partition. We also show how a judicious combination of these methods gives rise to a procedure that is sufficiently powerful to make possible the enumeration of all graphs on 10 points according to their partitions.

Original languageEnglish
Pages (from-to)183-196
Number of pages14
JournalJournal of Graph Theory
Issue number2
Publication statusPublished - 1981
Externally publishedYes

Cite this