Trees sorted by diameter

The file treeN.D.txt contains all the trees of order N and diameter D. The file treeN.all.tar.gz is a gzipped tar file containing all the files for that order.

There is one tree per line. The trees are given as an obvious list of edges, with vertices numbered from 0.

4 vertices:  2  3  all
5 vertices:  2  3  4  all
6 vertices:  2  3  4  5  all
7 vertices:  2  3  4  5  6  all
8 vertices:  2  3  4  5  6  7  all
9 vertices:  2  3  4  5  6  7  8  all
10 vertices:  2  3  4  5  6  7  8  9  all
11 vertices:  2  3  4  5  6  7  8  9  10  all
12 vertices:  2  3  4  5  6  7  8  9  10  11  all
13 vertices:  2  3  4  5  6  7  8  9  10  11  12  all
14 vertices:  2  3  4  5  6  7  8  9  10  11  12  13  all
15 vertices:  2  3  4  5  6  7  8  9  10  11  12  13  14  all
16 vertices:  2  3  4  5  6  7  8  9  10  11  12  13  14  15  all
17 vertices:  all
18 vertices:  all
19 vertices:  all
20 vertices:  all
21 vertices:  all
22 vertices:  all

Homeomorphically irreducible trees

These are trees with no vertices of degree 2. They are also called series-reduced trees.

 4 vertices (1 trees)
 5 vertices (1 trees)
 6 vertices (2 trees)
 7 vertices (2 trees)
 8 vertices (4 trees)
 9 vertices (5 trees)
 10 vertices (10 trees)
 11 vertices (14 trees)
 12 vertices (26 trees)
 13 vertices (42 trees)
 14 vertices (78 trees)
 15 vertices (132 trees)
 16 vertices (249 trees)
 17 vertices (445 trees)
 18 vertices (842 trees)
 19 vertices (1561 trees)
 20 vertices (2988 trees)
 21 vertices (5671 trees)
 22 vertices (10981 trees)
 23 vertices (21209 trees)
 24 vertices (41472 trees)
 25 vertices (81181 trees)
 26 vertices (160176 trees, gzipped)
 27 vertices (316749 trees, gzipped)
 28 vertices (629933 trees, gzipped)
 29 vertices (1256070 trees, gzipped)
 30 vertices (2515169 trees, gzipped)

 


Page Master: Brendan McKay, bdm@cs.anu.edu.au and http://cs.anu.edu.au/~bdm.

Up to the combinatorial data page