Counting unlabeled k-trees

JOURNAL OF COMBINATORIAL THEORY SERIES A

卷:126

Article

Gainer-Dewar, Andrew¹  Gessel, Ira M.² 

[1] Carleton Coll, Dept Math, Northfield, MN 55057 USA

[2] Brandeis Univ, Dept Math, Waltham, MA 02453 USA

关键词: Unlabeled k-trees;    Graphical enumeration;    Enumeration under group action;   

DOI  :  10.1016/j.jcta.2014.05.002

来源: Elsevier

【 摘 要 】

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. (C) 2014 Elsevier Inc. All rights reserved.

【 授权许可】

Free