Abstract
We count unlabeled k-trees by properly coloring them in k+1 colors and then counting orbits of these colorings under the action of the symmetric group on the colors.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.