Skip navigation
Skip navigation

The asymptotic number of claw-free cubic graphs

McKay, Brendan; Palmer, Edgar M; Read, Ronald C; Robinson, Robert W


Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. In an earlier paper we characterized claw-free cubic graphs and derived a recurrence relation for Hn. Here we determine the asymptotic behavior of this sequence: Hn ∼ (2n)!/e√6πn (n/

CollectionsANU Research Publications
Date published: 2003
Type: Journal article
Source: Discrete Mathematics
DOI: 10.1016/S0012-365X(03)00188-2


There are no files associated with this item.

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator