Generating Colored Trees (Extended Abstract)
Shin-ichi Nakano, Takeaki Uno · 2005
A c-tree is a tree such that each vertex has a color c ∈ {c1,c2, ··· ,cm}. In this paper we give a simple algorithm to generate all c-trees with at most n vertices and diameter d, without repetition. Our algorithm generates each c-tree in constant time. By using the algo- rithm for each diameter 2,3, ··· ,n− 1, we can generate all c-trees with n vertices.