Search
Now showing items 1-1 of 1
Refined enumeration of 2-noncrossing trees
(Academic Publishing House, 2021)
A 2-noncrossing tree is a connected graph without cycles that can be drawn in the
plane with its vertices on the boundary of circle such that the edges are straight line segments that
do not cross and all the vertices ...