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
Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices, On the free Lie algebra with multiple brackets, The combinatorics of Jeff Remmel, A note on the \(\gamma\)-coefficients of the tree Eulerian polynomial, The Moran forest, Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees, Counting acyclic and strong digraphs by descents, 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, Tree codes that preserve increases and degree sequences, Spanning trees: A survey, Unified parallel encoding and decoding algorithms for Dandelion-like codes, Bijections between affine hyperplane arrangements and valued graphs, On encodings of spanning trees, Identities of Rothe-Abel-Schläfli-Hurwitz-type, A recursive algorithm for trees and forests, Möbius coinvariants and bipartite edge-rooted forests, Gamma-positivity in combinatorics and geometry, A CLASS OF GRAPHS WHICH HAS EFFICIENT RANKING AND UNRANKING ALGORITHMS FOR SPANNING TREES AND FORESTS, Bijective linear time coding and decoding for \(k\)-trees, Parking cars after a trailer, Ascents and descents in random trees, A combinatorial approach for discrete car parking on random labelled trees, Runs in labelled trees and mappings, The number of spanning trees of a complete multipartite graph, Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition
Cites Work
