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
AbstractA feasible family of paths in a connected graph G is a family that contains at least one pat...
AbstractConvexity invariants like Caratheodory, Helly and Radon numbers are computed for triangle pa...
AbstractA set K of vertices in a connected graph is M-convex if and only if for every pair of vertic...
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph....
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph....
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph....
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph....
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph....
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph....
A feasible family of paths in a connected graph G is a family that contains at least one path betwee...
AbstractA feasible family of paths in a connected graph G is a family that contains at least one pat...
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph....
A feasible family of paths in a connected graph G is a family that contains at least one path betwee...
A feasible family of paths in a connected graph G is a family that contains at least one path betwee...
A feasible family of paths in a connected graph G is a family that contains at least one path betwee...
AbstractA feasible family of paths in a connected graph G is a family that contains at least one pat...
AbstractConvexity invariants like Caratheodory, Helly and Radon numbers are computed for triangle pa...
AbstractA set K of vertices in a connected graph is M-convex if and only if for every pair of vertic...
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph....
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph....
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph....
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph....
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph....
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph....
A feasible family of paths in a connected graph G is a family that contains at least one path betwee...
AbstractA feasible family of paths in a connected graph G is a family that contains at least one pat...
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph....
A feasible family of paths in a connected graph G is a family that contains at least one path betwee...
A feasible family of paths in a connected graph G is a family that contains at least one path betwee...
A feasible family of paths in a connected graph G is a family that contains at least one path betwee...
AbstractA feasible family of paths in a connected graph G is a family that contains at least one pat...
AbstractConvexity invariants like Caratheodory, Helly and Radon numbers are computed for triangle pa...
AbstractA set K of vertices in a connected graph is M-convex if and only if for every pair of vertic...