Isomorphic Factorization of Some Linearly Recursive Trees

摘要

It is known that some classes of graphs are 2-splittable, i.e. their edge sets can be partitioned into two sets so that the induced subgraphs are isomorphic. Fibonacci and Lucas trees both have this property. In this paper we extend this idea to partitioning into k sets and construct a general family of trees all of which are k-splittable.