Labelled trees and factorizations of a cycle into transpositions
From MaRDI portal
Publication:2366027
DOI10.1016/0012-365X(93)90522-UzbMath0779.05017OpenAlexW2087780064WikidataQ114215618 ScholiaQ114215618MaRDI QIDQ2366027
Publication date: 29 June 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)90522-u
Trees (05C05) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
The number of prefixes of minimal factorisations of a cycle, Random stable-type minimal factorizations of the n-cycle, Permutations as minimal powers of a single-cycle class-sum, Labelled trees and pairs of input-output permutations in priority queues, Transitive cycle factorizations and prime parking functions, A combinatorial interpretation of the bijection of Goulden and Yong, A Differential Operator for Symmetric Functions and the Combinatorics of Multiplying Transpositions, Labelled trees and pairs of input--output permutations in priority queues, Degrees in random uniform minimal factorizations, Trajectories in random minimal transposition factorizations, The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees, Enumeration of planar constellations, Factorizations of cycles and multi-noded rooted trees, Tree-like properties of cycle factorizations, Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson
Cites Work