✦ LIBER ✦

A Helly theorem for convexity in graphs

✍ Scribed by Robert E. Jamison; Richard Nowakowski

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 561 KB
Volume: 51
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90021-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Helly theorem for geodesic convexity i

A Helly theorem for geodesic convexity in strongly dismantlable graphs

✍ Norbert Polat 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 476 KB

A (finite or infinite) graph G is strongly dismantlable if its vertices can be linearly ordered x o ..... x~ so that, for each ordinal fl < ~, there exists a strictly increasing finite sequence (i~)0~<j~<n of ordinals such that i o = fl, i, = ct and xi~ +1 is adjacent with x~j and with all neighbors

A Helly theorem in weakly modular space

✍ Hans-Jürgen Bandelt; Victor Chepoi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 772 KB

The d-convex sets in a metric space are those subsets which include the metric interval between any two of its elements. Weak modularity is a certain interval property for triples of points. The d-convexity of a discrete weakly modular space X coincides with the geodesic convexity of the graph forme

Uniform Boundedness and Closed Graph The

Uniform Boundedness and Closed Graph Theorems for Convex Operators

✍ Michael M. Neumann 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 774 KB

A convexity theorem for multilinear func

A convexity theorem for multilinear functionals. II

✍ G.O Okikiolu 📂 Article 📅 1966 🏛 Elsevier Science 🌐 English ⚖ 311 KB

A theorem in convex programming

✍ William Karush 📂 Article 📅 1959 🏛 John Wiley and Sons 🌐 English ⚖ 558 KB

## System Develofiment Corporation S a n t a Monica, California An optimization problem which frequently a r i s e s in applications of mathematical programming is the following: t fn (xn)l , A 5x1' . . . Lx, 5 B where f i a r e convex functions. In this paper, the function F i s studied and show

A Convexity Lemma and Expansion Procedur

A Convexity Lemma and Expansion Procedures for Bipartite Graphs

✍ W. Imrich; S. Klavžar 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 148 KB

A hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical complexes, median graphs, almost-median graphs, semi-median graphs and partial cubes. Structural properties of these classes are derived and used for the characterization of these classes by expansion procedures,