Sciweavers

SIAMDM
2010
130views more  SIAMDM 2010»
13 years 9 months ago
On the Hull Number of Triangle-Free Graphs
A set of vertices C in a graph is convex if it contains all vertices which lie on shortest paths between vertices in C. The convex hull of a set of vertices S is the smallest conve...
Mitre Costa Dourado, Fábio Protti, Dieter R...