Path Separability of Graphs

In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several graph families having such path separability, and we show that this property is closed under minor taking. In particular we establish a list of forbidden minors for 1-path separable graphs.

• Type: Journal
• Year: 2010
• Where: FAW
• Authors: Emilie Diot, Cyril Gavoille
• Keywords: Algorithms, FAW 2010, K-path Separable Graphs, Shortest Paths, Structural Properties