Short Disjoint Paths in Locally Connected Graphs

摘要

Chartrand and Pippert proved that a connected, locally k-connected graph is (k + 1)-connected. We investigate the lengths of k + 1 disjoint paths between two vertices in locally k-connected graphs with respect to several graph parameters, e.g. the k-diameter of a graph. We also give a generalization of the mentioned result.