A tree R such that after deleting all leaves we obtain a path P is called a caterpillar. The path P is called the spine of the caterpillar R . If the spine has length 3 and R on 2n vertices containsâ€¦ (More)

We examine constructions of non-symmetric trees with a flexible q-labeling or an Î±-like labeling, which allow factorization of K2n into spanning trees, arising from the trees with Î±-labelings.

A tree R such that after deleting all leaves we obtain a path P is called a caterpillar. The path P is called the spine of the caterpillar R . If the spine has length 3 and R on 2n vertices containsâ€¦ (More)