On the number of \(t\)-ary trees with a given path length

DOI10.1007/s00453-006-0122-8zbMath1106.68087arXivcs/0509046OpenAlexW3101808853MaRDI QIDQ866964

Gadiel Seroussi

Publication date: 14 February 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0509046

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Information theory (general) (94A15)

Related Items (1)

Staircase tilings and \(k\)-Catalan structures

This page was built for publication: On the number of \(t\)-ary trees with a given path length