The Generalisation of Tutte's Result for Chromatic Trees, by Lagrangian Methods

DOI10.4153/CJM-1981-002-2zbMath0492.05037OpenAlexW2320746851MaRDI QIDQ3953793

David M. Jackson, Ian P. Goulden

Publication date: 1981

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1981-002-2

zbMATH Keywords

plane rooted treecolour partitionchromatic partitioncoloured tree

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items

Éclosions combinatoires appliquées à l'inversion multidimensionnelle des séries formelles. (Combinatorial bloomings applied to the multidimensional inversion of formal series), Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti, On the number of induced subgraphs of trees, A combinatorial proof of the multivariable Lagrange inversion formula, Enumeration of (uni- or bicolored) plane trees according to their degree distribution, The enumeration of directed closed Euler trails and directed Hamiltonian circuits by Lagrangian methods