scientific article; zbMATH DE number 7656033

DOI10.33048/daio.2022.29.732MaRDI QIDQ5878629

No author found.

Publication date: 21 February 2023

Full work available at URL: http://mathnet.ru/eng/da1306

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

asymptoticsblockenumerationlabeled graphrandom graphseries-parallel graph\(k\)-cyclic graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Uses Software

• DLMF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random graphs from a block-stable class
• Enumeration and limit laws for series-parallel graphs
• Enumeration of labeled connected graphs with given order and size
• The number of connected sparsely edged graphs. III. Asymptotic results
• Linear-time computability of combinatorial problems on series-parallel graphs
• The number of connected sparsely edged graphs
• The number of connected sparsely edged graphs. II. Smooth graphs and blocks
• Low-connectivity network design on series-parallel graphs
• The Second Riddell Relation and Its Consequences

This page was built for publication: