Advertisement
Published in:
2010 | OriginalPaper | Chapter
Path Separability of Graphs
Authors : Emilie Diot, Cyril Gavoille
Published in: Frontiers in Algorithmics
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.