𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A gradient bound for free boundary graphs

✍ Scribed by Daniela De Silva; David Jerison


Book ID
102119946
Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
169 KB
Volume
64
Category
Article
ISSN
0010-3640

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


AT-free graphs: linear bounds for the or
✍ Fedor V Fomin; Martı́n Matamala; Erich Prisner; Ivan Rapaport πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 268 KB

Let G be a bridgeless connected undirected (b.c.u.) graph. The oriented diameter of G, OD(G), is given by OD(G)=min{diam(H ): H is an orientation of G}, where diam(H ) is the maximum length computed over the lengths of all the shortest directed paths in H . This work starts with a result stating tha