Enumeration of noncrossing trees on a circle
A noncrossing graph is a graph whose vertices lie on the circumference of a circle and whose edges are straight line segments that do not cross each other. The author considers various enumeration problems for noncrossing trees, forests, and unicyclic graphs.
scientific article; zbMATH DE number 1135945