Exploratory numerical extension of strict m-gonal cactus graph enumeration to mixed cycle-length sets (Ω = {5, 6}), via split-decomposition.
-
Updated
Aug 7, 2026 - Python
#
cactus-graphs
Here are 2 public repositories matching this topic...
Verification code for 'Enumeration and Asymptotic Analysis of Strict Non-Plane Cactus Graphs over a Finite Set of Cycle Lengths' - extends the companion single-length paper to a finite mixed set Ω. Includes an exact grammar solver, a high-precision critical-point solver, a Table 1 reproduction script, and a 14-test regression suite.
graph-theory combinatorics oeis generating-functions enumerative-combinatorics cactus-graphs split-decomposition
-
Updated
Aug 27, 2026 - Python
Improve this page
Add a description, image, and links to the cactus-graphs topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the cactus-graphs topic, visit your repo's landing page and select "manage topics."