Local 2-separators

Abstract

How can sparse graph theory be extended to large networks, where algorithms whose running time is estimated using the number of vertices are not good enough? I address this question by introducing 'Local Separators' of graphs. Applications include:1. A unique decomposition theorem for graphs along their local 2separators analogous to the 2-separator theorem;2. an exact characterisation of graphs with no bounded subdivision of a wheel;