McKay, BrendanPalmer, Edgar MRead, Ronald CRobinson, Robert W2015-12-132015-12-130012-365Xhttp://hdl.handle.net/1885/76790Let 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/Keywords: Asymptotic stability; Functions; Hamiltonians; Probability; Problem solving; Theorem proving; Cubic graphs; Graph theory Asymptotic enumeration; Claw-free; Cubic graphs200310.1016/S0012-365X(03)00188-22015-12-11