𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A bound for the degree of nonholonomy in the plane

✍ Scribed by Jean-Jacques Risler

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
482 KB
Volume
157
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A short proof of the degree bound for in
A short proof of the degree bound for interval number
✍ Douglas B. West πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 141 KB

A short proof is given of the fact that every graph has an interval representation of depth 2 in which each vertex u is represented by at most &f(u) + 11 intervals, except for an arbitrarily specified vertex w that appears left-most in the representation and is represented by at most [&d(w) + 1)1 in

A tight lower bound for the Steiner rati
A tight lower bound for the Steiner ratio in Minkowski planes
✍ Biao Gao; Ding-Zhu Du; Ronald L. Graham πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 804 KB

A minimum Steiner tree for a given set X of points is a network interconnecting the points of X having minimum possible total length. The Steiner ratio for a metric space is the largest lower bound for the ratio of lengths between a minimum Steiner tree and a minimum spanning tree on the same set of

Degree bounds for the circumference of 3
Degree bounds for the circumference of 3-connected graphs
✍ Heinz A. Jung; Elkin Vumar πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 229 KB πŸ‘ 1 views

## Abstract Let __C__ be a longest cycle in the 3‐connected graph __G__ and let __H__ be a component of __G__β€‰βˆ’β€‰__V__(__C__) such that |__V__(__H__)| β‰₯ 3. We supply estimates of the form |__C__| β‰₯ 2__d__(__u__) + 2__d__(__v__)β€‰βˆ’β€‰Ξ±(4 ≀ α ≀ 8), where __u__,__v__ are suitably chosen non‐adjacent verti