Generalized LR-drawings of trees
Computational Geometry
2021-05-17 v1 Combinatorics
Abstract
The LR-drawing-method is a method of drawing an ordered rooted binary tree based on drawing one root-to-leaf path on a vertical line and attaching recursively obtained drawings of the subtrees on the left and right. In this paper, we study how to generalize this drawing-method to trees of higher arity. We first prove that (with some careful modifications) the proof of existence of a special root-to-leaf path transfers to trees of higher arity. Then we use such paths to obtain generalized LR-drawings of trees of arbitrary arity.
Cite
@article{arxiv.2105.06992,
title = {Generalized LR-drawings of trees},
author = {Therese Biedl and Giuseppe Liotta and Jayson Lynch and Fabrizio Montecchiani},
journal= {arXiv preprint arXiv:2105.06992},
year = {2021}
}