Path separability of graphs

Authors:
Emilie Diot;Cyril Gavoille
Affiliations:
Université de Bordeaux, LaBRI, France;Université de Bordeaux, LaBRI, France
Venue:
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Year:
2010

Citing 7
Cited 0

Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Graph minors. XVI. excluding a non-planar graph

Journal of Combinatorial Theory Series B
Compact oracles for reachability and approximate distances in planar digraphs

Journal of the ACM (JACM)
Graph Minors. XX. Wagner's conjecture

Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Object location using path separators

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs

Proceedings of the twenty-fourth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.