Locally oriented noncrossing trees

zbMath1323.05034MaRDI QIDQ888594

N. E. Zubov

Publication date: 2 November 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i3p36

zbMATH Keywords

noncrossing treesindegree and outdegree sequencelocal orientation

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex degrees (05C07)

Related Items (3)

Enumeration of generalized Dyck paths based on the height of down-steps modulo \(k\) ⋮ Random matrices associated to Young diagrams ⋮ Unnamed Item

Cites Work

• A bijective enumeration of labeled trees with given indegree sequence
• Labeled trees, functions, and an algebraic identity
• Chords, trees and permutations
• Counting labelled trees with given indegree sequence
• Some remarks on Catalan families
• Analytic combinatorics of non-crossing configurations
• Enumeration of noncrossing trees on a circle
• Descents in noncrossing trees
• Bijections for ternary trees and non-crossing trees
• Statistics on non-crossing trees
• A refinement of leaves on noncrossing trees
• Geometry of curves with exceptional secant planes: Linear series along the general curve
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Locally oriented noncrossing trees