Enumeration of noncrossing trees on a circle
type: Item
instance of: scholarly article
title: Enumeration of noncrossing trees on a circle
zbMATH Open document ID: 0895.05031
DOI: 10.1016/S0012-365X(97)00121-0
author: Marc Noy
published in: Discrete Mathematics
publication date: 1998-04-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 1135945
zbMATH Keywords: circle
zbMATH Keywords: noncrossing graph
zbMATH Keywords: enumeration
zbMATH Keywords: trees
zbMATH Keywords: forests
zbMATH Keywords: unicyclic graphs
reviewed by: J. W. Moon
MaRDI profile type: Publication
cites work: Asymptotic Methods in Enumeration
cites work: Q4769056
cites work: Enumeration of ladder graphs
cites work: Chords, trees and permutations
cites work: Catalan numbers, their generalization, and their uses
cites work: Q5616724
cites work: Triangular Dissections of N-Gons
cites work: On the Number of Distinct Forests
cites work: A Proof of Kirkman's Hypothesis
cites work: The method of creative telescoping
description: scientific article; zbMATH DE number 1135945