ARBITRARILY VERTEX DECOMPOSABLE TREES ARE OF MAXIMUM DEGREE AT MOST SIX
Mirko Horňák, Mariusz Woźniak · Opuscula Mathematica · 2003
A tree T is arbitrarily vertex decomposable if for any sequence of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by . It is proved that if a tree T is arbitrarily vertex decomposable, then ( T) 6.