= Caterpillar tree
A <caterpillar tree> is a <tree> whose non-leaf vertices lie on a single <path>, called its spine. Equivalently, deleting all degree-one vertices leaves a <path>, a single vertex, or an empty <graph> in the smallest cases. A <star graph> is a <caterpillar tree> with a one-vertex spine; every <path graph> is also a <caterpillar tree>. <Trees> with branching that persists after deleting the leaves fail the definition. The spine packages a seemingly branching structure into a linear backbone with attached leaves, which simplifies many <counting> and layout questions.
Back to article page