Problemadvanced
Free unlabeled tree generation
Also called Generating free trees, Unrooted tree enumeration.
Enumerate all non-isomorphic trees with n nodes where no node is distinguished as root.
Enumerate all non-isomorphic trees with n nodes where no node is distinguished as root.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 4PEVCW Edit this page History Report an error