Fringe thickness and maximum path length of binary trees

DOI10.1016/S0166-218X(98)00117-6zbMath0927.68064OpenAlexW2084039715MaRDI QIDQ1281386

Helen Cameron

Publication date: 22 March 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(98)00117-6

zbMATH Keywords

binary treesmaximum path length

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Minimal path length of trees with known fringe
• Maximal path length of binary trees
• Pm numbers, ambiguity, and regularity
• On the path length of binary trees
• Tight Upper and Lower Bounds on the Path Length of Binary Trees
• Binary trees, fringe thickness and minimum path length
• Upper Bounds for the Total Path Length of Binary Trees

This page was built for publication: Fringe thickness and maximum path length of binary trees