Enumeration of labeled outerplanar bicyclic and tricyclic graphs
From MaRDI portal
Publication:5373995
DOI10.1134/S1990478917020168zbMath1399.05114OpenAlexW2620205518MaRDI QIDQ5373995
No author found.
Publication date: 6 April 2018
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1990478917020168
Enumeration in graph theory (05C30) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Connectivity (05C40)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumeration and limit laws for series-parallel graphs
- A Recurrence Related to Trees
- The number of connected sparsely edged graphs
- The number of connected sparsely edged graphs. II. Smooth graphs and blocks
- Enumeration of labeled block-cactus graphs
- Generating Outerplanar Graphs Uniformly at Random
- Some Unusual Enumeration Problems
This page was built for publication: Enumeration of labeled outerplanar bicyclic and tricyclic graphs