Abstract
After treating graph classes and class resolutions we return to the basics: the structure of finite trees as the true measure of our things.
Where the reader will discover that short branches can make large trees beautiful.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nešetřil, J., de Mendez, P.O. (2012). Bounded Height Trees and Tree-Depth. In: Sparsity. Algorithms and Combinatorics, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27875-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-27875-4_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27874-7
Online ISBN: 978-3-642-27875-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)