𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Helly theorems for 3-Steiner and 3-monophonic convexity in graphs

✍ Scribed by Morten H. Nielsen; Ortrud R. Oellermann

Book ID
108114304
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
277 KB
Volume
311
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Helly theorem for convexity in graphs
A Helly theorem for convexity in graphs
✍ Robert E. Jamison; Richard Nowakowski πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 561 KB
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