Convexities related to path properties on graphs; a unified approach
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph. The general notion of path property, introduced in this paper, gives rise to a comprehensive survey of results obtained by different authors for a variety of path properties, together with a number of new results. We pay special attention to convexities defined by path properties on graph products and the classical convexity invariants, such as the Caratheodory, Helly and Radon numbers in relation with graph invariants, such as clique numbers and other graph properties.
Year of publication: |
2000
|
---|---|
Authors: | Sierksma, G. ; Mulder, H.M. ; Changat, M. |
Institutions: | Faculteit Economie en Bedrijfskunde, Rijksuniversiteit Groningen |
Saved in:
freely available
Saved in favorites
Similar items by person
-
Sensitivity analysis of the greedy heuristic for binary knapsack problems
Ghosh, D., (2000)
-
Decomposed versus integrated control of a one-stage production system
Broersma, A.L.A., (1999)
-
Complete local search with memory
Sierksma, G., (2000)
- More ...