On the Path Separability of Planar Graphs

DOI10.1016/J.ENDM.2009.07.091zbMath1273.05122OpenAlexW1979838692MaRDI QIDQ2851515

Cyril Gavoille, Emilie Diot

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.091

zbMATH Keywords

weighted planar graphspath-separableunbounded treewidth graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Signed and weighted graphs (05C22)

Cites Work

• Graph minors. XVI: Excluding a non-planar graph
• Parametrized complexity theory.
• Object location using path separators
• Compact oracles for reachability and approximate distances in planar digraphs

This page was built for publication: On the Path Separability of Planar Graphs