Counting labelled 3-connected graphs

Research output: Contribution to journalComment / DebateOtherpeer-review

Abstract

Labelled connected graphs were first counted by Riddell [3], as were unlabelled connected graphs and labelled 2-connected graphs. Robinson[4] developed the only known method of counting unlabelled 2-connected graphs. We have found a recursive method of counting labelled 3-connected graphs. The corresponding problem for unlabelled graphs remains unsolved.
Original languageEnglish
Pages (from-to)383-384
Number of pages2
JournalJournal of Graph Theory
Volume1
Issue number4
DOIs
Publication statusPublished - 1977
Externally publishedYes

Cite this