𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A forbidden minor characterization and reliability of a class of partial 4-trees

✍ Scribed by Gerard T. Lingner; Themistocles Politof; A. Satyanarayana

Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
801 KB
Volume
25
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Paths of Greedoids and a Minor Charac
On Paths of Greedoids and a Minor Characterization
✍ Erhard Hexel πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 156 KB

Let \(p_{n}\) denote the maximum number of paths a greedoid over \(n\) elements can have. As an upper bound, we of course have \(p_{n}<2^{n}\). We establish a lower bound for the maximum: \(1.6 \cdot 3^{n / 3}<p_{n}\). In the class of simple greedoids (those greedoids on \(n\) elements having exactl

A characterization of (Ξ³, i)-trees
A characterization of (Ξ³, i)-trees
✍ E. J. Cockayne; O. Favaron; C. M. Mynhardt; J. Puech πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 170 KB