scientific article; zbMATH DE number 7656033
From MaRDI portal
Publication:5878629
DOI10.33048/DAIO.2022.29.732MaRDI QIDQ5878629FDOQ5878629
Authors:
Publication date: 21 February 2023
Full work available at URL: http://mathnet.ru/eng/da1306
Title of this publication is not available (Why is that?)
Recommendations
- On the enumeration of labeled series-parallel \(k\)-cyclic 2-connected graphs
- Asymptotic enumeration of labeled series-parallel \(k\)-cyclic bridgeless graphs
- Asymptotic enumeration of series-parallel graphs
- Enumeration and limit laws for series-parallel graphs
- On the number of series parallel and outerplanar graphs
Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- NIST handbook of mathematical functions
- Enumeration and limit laws for series-parallel graphs
- The number of connected sparsely edged graphs
- The number of connected sparsely edged graphs. II. Smooth graphs and blocks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Low-connectivity network design on series-parallel graphs
- Linear-time computability of combinatorial problems on series-parallel graphs
- The number of connected sparsely edged graphs. III. Asymptotic results
- The second Riddell relation and its consequences
- Random graphs from a block-stable class
- Enumeration of labeled connected graphs with given order and size
Cited In (5)
- Enumeration of labeled series-parallel tricyclic graphs
- The number of labeled tetracyclic series-parallel blocks
- On the enumeration of labeled series-parallel \(k\)-cyclic 2-connected graphs
- Asymptotic enumeration of labeled series-parallel \(k\)-cyclic bridgeless graphs
- Enumeration of labeled Eulerian pentacyclic graphs
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5878629)
