Path Separability of Graphs

DOI10.1007/978-3-642-14553-7_25MaRDI QIDQ3587357zbMATH OpenOpenAlexFDO

Authors Emilie Diot, Cyril Gavoille

Publication date 7 September 2010

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14553-7_25

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph minors (05C83)

Recommendations

• On the path separation number of graphs
• On the path separability of planar graphs
• On the separability of graphs
• Path-connectivity in graphs
• scientific article; zbMATH DE number 4089593
• Connectivity of path graphs
• scientific article; zbMATH DE number 1744097
• scientific article; zbMATH DE number 2172752
• Disjoint paths in graphs
• Path partitionable graphs

Cited in

(12)

• On the path separability of planar graphs
• Graphs of separability at most 2
• Separating path systems of almost linear size
• Object location using path separators
• Toggling independent sets of a path graph
• On the path separation number of graphs
• Graphs of separability at most two: structural characterizations and their consequences
• Separating path systems
• The vertex separation number of a graph equals its path-width
• On the separability of graphs
• Metric decompositions of path-separable graphs
• Path transferability of graphs

This page was built for publication: Path Separability of Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587357)