On the helly property working as a compactness criterion on graphs
- 30 September 1985
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 40 (1) , 186-193
- https://doi.org/10.1016/0097-3165(85)90061-5
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The smallest graph variety containing all pathsDiscrete Mathematics, 1983
- On a class of isometric subgraphs of a graphCombinatorica, 1982
- Fixed-edge theorem for graphs with loopsJournal of Graph Theory, 1979
- The Game of Hex and the Brouwer Fixed-Point TheoremThe American Mathematical Monthly, 1979
- Fixed points in partially ordered setsAdvances in Mathematics, 1979
- A fixed point theorem for finite partially ordered setsJournal of Combinatorial Theory, Series A, 1976
- Compact metric spaces have binary basesFundamenta Mathematicae, 1975
- Absolute retracts in graphsLecture Notes in Mathematics, 1974
- Graph derivativesMathematische Zeitschrift, 1961
- Partially Ordered SetsAmerican Journal of Mathematics, 1941