Enumeration of noncrossing trees on a circle (Q1381832)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1135945
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumeration of noncrossing trees on a circle |
scientific article; zbMATH DE number 1135945 |
Statements
Enumeration of noncrossing trees on a circle (English)
0 references
1 April 1998
0 references
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.
0 references
circle
0 references
noncrossing graph
0 references
enumeration
0 references
trees
0 references
forests
0 references
unicyclic graphs
0 references
0.8311882019042969
0 references
0.8005886077880859
0 references
0.7634316682815552
0 references
