Enumeration of noncrossing trees on a circle
From MaRDI portal
Publication:1381832
DOI10.1016/S0012-365X(97)00121-0zbMath0895.05031MaRDI QIDQ1381832
Publication date: 1 April 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Nested Catalan tables and a recurrence relation in noncommutative quantum field theory, Noncrossing trees are almost conditioned Galton–Watson trees, On planar path transformation, Are crossing dependencies really scarce?, On \(\gamma\)-positive polynomials arising in pattern avoidance, Consecutive pattern avoidances in non-crossing trees, Combinatoric enumeration of two-dimensional proper arrays, Maximal rigid objects as noncrossing bipartite graphs, Brussels sprouts, noncrossing trees, and parking functions, Locally oriented noncrossing trees, A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate, A decomposition algorithm for noncrossing trees, Noncrossing partitions, noncrossing graphs, and \(q\)-permanental equations, A refinement of leaves on noncrossing trees, Non-crossing Tree Realizations of Ordered Degree Sequences, The biplanar tree graph, Unnamed Item, Dyck paths with coloured ascents, The scaling of the minimum sum of edge lengths in uniformly random trees, 2-binary trees: bijections and related issues, The cyclic sieving phenomenon for faces of generalized cluster complexes, Unnamed Item, Non-crossing trees, quadrangular dissections, ternary trees, and duality-preserving bijections, Staircase tilings and \(k\)-Catalan structures, Linear $k$-Chord Diagrams, Decomposition and merging algorithms for noncrossing forests, Geometric tree graphs of points in convex position, 2-noncrossing trees and 5-ary trees, Analytic combinatorics of non-crossing configurations
Cites Work