Separating path systems for cubic graphs and for complete bipartite graphs

A strongly separating path system in a graph G is a collection P of paths in G such that, for every two edges e and f of G , there is a path in P with e but not f , and vice-versa. The minimum size of such a system is the so called strong separation number of G . We prove that the strong separation number of every 2-degenerate graph on n vertices is at most n . Using this, we also provide upper bounds for the strong separation number of subcubic graphs, planar graphs, and planar bipartite graphs. On the other hand, we prove that the strong separation number of a complete bipartite graph K a , b is at least b if a < b / 2 and at least ( 6 ( b / 2 ) + 4 − 2 ) a if b / 2 ≤ a ≤ b , and we provide a construction that attains the former bound.