On the number of labeled 2-trees
From MaRDI portal
Publication:5565632
DOI10.1016/S0021-9800(69)80121-3zbMath0175.50202OpenAlexW2026888628MaRDI QIDQ5565632
Publication date: 1969
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(69)80121-3
Related Items (5)
Properties and characterizations of k ‐trees ⋮ A coding algorithm for Rényi trees ⋮ The specification of 2-trees ⋮ Enumerating k-trees ⋮ Labelled and unlabelled enumeration of \(k\)-gonal 2-trees
This page was built for publication: On the number of labeled 2-trees