22 search results - page 2 / 5 » Noncrossing Trees and Noncrossing Graphs |
COMBINATORICS
2006
13 years 4 months ago
2006
This note contains two results on the distribution of k-crossings and k-nestings in graphs. On the positive side, we exhibit a class of graphs for which there are as many k-noncro...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum numb...
ISAAC
1992
Springer
13 years 8 months ago
1992
Springer
Let G be an undirected plane graph with non-negative edge length, and let k terminal pairs lie on two specified face boundaries. This paper presents an algorithm for finding k &quo...
DAM
1998
13 years 4 months ago
1998
We give a simple and natural proof of (an extension of) the identity P(k, l, n) = P2(k − 1, l − 1, n − 1). The number P(k, l, n) counts noncrossing partitions of {1, 2, . . ...
DRW
2003
13 years 5 months ago
2003