The number of labeled outerplanar \(k\)-cyclic graphs
From MaRDI portal
Publication:1668057
DOI10.1134/S0001434618050024zbMath1394.05022OpenAlexW2810495142MaRDI QIDQ1668057
Publication date: 31 August 2018
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434618050024
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Connectivity (05C40)
Related Items (2)
On the number of labeled outerplanar $k$-cyclic bridgeless graphs ⋮ Enumeration of labeled series-parallel tricyclic graphs
Uses Software
Cites Work
- Enumeration and limit laws for series-parallel graphs
- Vertices of given degree in series-parallel graphs
- Enumeration of labeled connected graphs with given order and size
- The number of connected sparsely edged graphs. III. Asymptotic results
- Generating Outerplanar Graphs Uniformly at Random
- On the maximum number of cycles in outerplanar and series-parallel graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The number of labeled outerplanar \(k\)-cyclic graphs