Enumeration of labeled connected bicyclic and tricyclic graphs without bridges

DOI10.1134/S0001434612010300zbMath1282.05068OpenAlexW2062248040MaRDI QIDQ2435939

Yanyan Li

Publication date: 21 February 2014

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434612010300

zbMATH Keywords

enumerationlabeled graphconnected graphbridgebicyclic graphtricyclic graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (3)

Enumeration of labeled connected graphs with given order and size ⋮ Asymptotic enumeration of labeled series-parallel $k$-cyclic bridgeless graphs ⋮ Enumeration of labeled bicyclic and tricyclic Eulerian graphs

Uses Software

• OEIS

Cites Work

• Counting bridgeless graphs
• Enumeration of smooth labelled graphs
• The number of connected sparsely edged graphs. II. Smooth graphs and blocks
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumeration of labeled connected bicyclic and tricyclic graphs without bridges