Sciweavers

DM
2007
135views more  DM 2007»
13 years 4 months ago
Heavy fans, cycles and paths in weighted graphs of large connectivity
A set of paths joining a vertex y and a vertex set L is called (y, L)-fan if any two of the paths have only y in common, and its width is the number of paths forming it. In weight...
Jun Fujisawa