Unlabelled trees
module univalent-combinatorics.unlabeled-trees where
Imports
Idea
An unlabelled tree is an undirected graph G such that any cycle in G must
have length 1.
module univalent-combinatorics.unlabeled-trees where
An unlabelled tree is an undirected graph G such that any cycle in G must
have length 1.