Counting Claw-Free Cubic Graphs

DOI10.1137/S0895480194274777zbMath1037.05004OpenAlexW2109425200MaRDI QIDQ4785706

Ronald C. Read, Robert W. Robinson, Edgar M. Palmer

Publication date: 5 January 2003

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480194274777

zbMATH Keywords

exponential generating function\(P\)-recursive sequencelabeled graph counting

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items (4)

The asymptotic number of claw-free cubic graphs. ⋮ Enumeration of unlabeled uniform hypergraphs ⋮ Counting labeled general cubic graphs ⋮ Counting labeled claw-free cubic graphs by connectivity

This page was built for publication: Counting Claw-Free Cubic Graphs