Counting unlabeled k-trees

18Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2014 Elsevier Inc.

Cite

CITATION STYLE

APA

Gainer-Dewar, A., & Gessel, I. M. (2014). Counting unlabeled k-trees. Journal of Combinatorial Theory. Series A, 126(1), 177–193. https://doi.org/10.1016/j.jcta.2014.05.002

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free