On the number of labeled 2-trees

DOI10.1016/S0021-9800(69)80121-3zbMATH Open0175.50202OpenAlexW2026888628MaRDI QIDQ5565632FDOQ5565632

Edgar M. Palmer

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

zbMATH Keywords

topology

Cited In (5)

• A coding algorithm for Rényi trees
• Properties and characterizations of k ‐trees
• The specification of 2-trees
• Labelled and unlabelled enumeration of \(k\)-gonal 2-trees
• Enumerating k-trees

This page was built for publication: On the number of labeled 2-trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5565632)