Enumeration of labeled connected graphs with given order and size

DOI10.1134/S1990478916020149zbMath1349.05174MaRDI QIDQ3186860

No author found.

Publication date: 12 August 2016

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

asymptoticsblockenumerationlabeled graphcactus

Mathematics Subject Classification ID

05C30: Enumeration in graph theory

05C78: Graph labelling (graceful graphs, bandwidth, etc.)

05C40: Connectivity

Related Items

The Second Riddell Relation and Its Consequences, On the number of labeled outerplanar $k$-cyclic bridgeless graphs, Asymptotic enumeration of labeled series-parallel $k$-cyclic bridgeless graphs, Unnamed Item, Enumeration of labeled series-parallel tricyclic graphs, The number of labeled outerplanar \(k\)-cyclic graphs, Enumeration of labeled geodetic graphs with small cyclomatic number

Uses Software

• DLMF

Cites Work

• Enumerative problems inspired by Mayer's theory of cluster integrals
• Enumeration of labeled bicyclic and tricyclic Eulerian graphs
• Enumeration of labeled geodetic planar graphs
• Enumeration of labeled connected bicyclic and tricyclic graphs without bridges
• On enumeration of labelled connected graphs by the number of cutpoints
• The number of connected sparsely edged graphs. III. Asymptotic results
• Asymptotic Study of Subcritical Graph Classes
• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. III
• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I
• Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
• Enumeration of labeled block-cactus graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item