Refined enumeration of \(k\)-plane trees and \(k\)-noncrossing trees

DOI10.1007/s00026-023-00642-6arXiv2205.01002OpenAlexW4382772270MaRDI QIDQ6192068

No author found.

Publication date: 11 March 2024

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.01002

zbMATH Keywords

counting formula\(k\)-noncrossing treeslabelled noncrossing trees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Twelve countings with rooted plane trees
• Bijections for a class of labeled plane trees
• Staircase tilings and \(k\)-Catalan structures
• 2-noncrossing trees and 5-ary trees
• Enumeration of generalized Dyck paths based on the height of down-steps modulo \(k\)