Verification code for "Strict Monotonicity of the Growth Rate for Non-Plane Strict m-Gonal Cactus Graphs"
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.
Exploratory numerical extension of strict m-gonal cactus graph enumeration to mixed cycle-length sets (Ω = {5, 6}), via split-decomposition.
Independent verification code for "Enumeration of Non-Plane m-Gonal Cactus Graphs via Split-Decomposition"
Add a description, image, and links to the enumerative-combinatorics topic page so that developers can more easily learn about it.
To associate your repository with the enumerative-combinatorics topic, visit your repo's landing page and select "manage topics."