Enumeration of coloured plane trees with a given type partition

Autor: John A. Torkington, Manfred Gordon
Rok vydání: 1980
Předmět:
Zdroj: Discrete Applied Mathematics. 2(3):207-223
ISSN: 0166-218X
DOI: 10.1016/0166-218x(80)90041-4
Popis: Tutte's result for the number of planted plane trees with a given degree partition is rederived by a variety of methods and in particular by a simple piecewise construction technique. A theorem of Gordon and Temple is applied in order to give a general relationship between the number of planted plane trees and the number of rooted plane trees and the degree partition restriction is generalised to type partition. The piecewise construction method is successfully used to derive the number of planted plane trees with a given 2-colour degree partition, also derived by Tutte, and an algorithm for the k-coloured case is developed. This algorithm may be used to obtain more specific results. These models are relevant to the statistical mechanics of polymers and this is discussed briefly.
Databáze: OpenAIRE