Counting Claw-Free Cubic Graphs

DOI10.1137/S0895480194274777zbMATH Open1037.05004OpenAlexW2109425200MaRDI QIDQ4785706FDOQ4785706

Authors: Ronald C. Read, Edgar M. Palmer, R. W. Robinson 

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

Recommendations

• Counting labeled claw-free cubic graphs by connectivity
• The asymptotic number of claw-free cubic graphs.
• Counting labeled general cubic graphs
• Counting independent sets in claw-free graphs
• Enumeration of cyclically 4-connected cubic graphs

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)

Cited In (8)

• Claw-free cubic graphs with clique-transversal number half of their order
• The asymptotic number of claw-free cubic graphs.
• Counting labeled general cubic graphs
• Enumeration of unlabeled uniform hypergraphs
• Counting labeled claw-free cubic graphs by connectivity
• Clique-chromatic numbers of claw-free graphs
• Enumeration of cyclically 4-connected cubic graphs
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785706)