THE NUMBER OF LABELED TETRACYCLIC SERIES-PARALLEL BLOCKS

DOI10.17223/20710410/47/5zbMath1455.05074OpenAlexW3011982874MaRDI QIDQ5151435

No author found.

Publication date: 17 February 2021

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

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

zbMATH Keywords

asymptoticsblockenumerationlabeled graphseries-parallel graphtetracyclic graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

On the enumeration of labeled series-parallel $k$-cyclic $2$-connected graphs ⋮ Enumeration of labeled series-parallel tricyclic graphs ⋮ A new formula for the number of labeled series-parallel graphs

Cites Work

• Enumeration and limit laws for series-parallel graphs
• Linear-time computability of combinatorial problems on series-parallel 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
• The Enumeration of Homeomorphically Irreducible Star Graphs
• Unnamed Item

This page was built for publication: THE NUMBER OF LABELED TETRACYCLIC SERIES-PARALLEL BLOCKS