Bijections for Cayley trees, spanning trees, and their q-analogues
From MaRDI portal
Publication:1077424
DOI10.1016/0097-3165(86)90004-XzbMath0595.05025MaRDI QIDQ1077424
Ömer Eğecioğlu, Jeffery B. Remmel
Publication date: 1986
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Related Items
Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition, The combinatorics of Jeff Remmel, Parking cars after a trailer, The Moran forest, On the free Lie algebra with multiple brackets, Bijections between affine hyperplane arrangements and valued graphs, A recursive algorithm for trees and forests, Spanning trees: A survey, Unified parallel encoding and decoding algorithms for Dandelion-like codes, Runs in labelled trees and mappings, Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices, Bijective linear time coding and decoding for \(k\)-trees, Tree codes that preserve increases and degree sequences, Identities of Rothe-Abel-Schläfli-Hurwitz-type, The number of spanning trees of a complete multipartite graph, A blossoming algorithm for tree volumes of composite digraphs, Gessel polynomials, rooks, and extended linial arrangements, Number of spanning trees of different products of complete and complete bipartite graphs, Möbius coinvariants and bipartite edge-rooted forests, Gamma-positivity in combinatorics and geometry, Counting acyclic and strong digraphs by descents, A combinatorial approach for discrete car parking on random labelled trees, On encodings of spanning trees, A note on the \(\gamma\)-coefficients of the tree Eulerian polynomial, Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees, A CLASS OF GRAPHS WHICH HAS EFFICIENT RANKING AND UNRANKING ALGORITHMS FOR SPANNING TREES AND FORESTS, Ascents and descents in random trees
Cites Work
