The first order definability of graphs with separators via the Ehrenfeucht game

Our proof techniques are based on the characterization of the quantifier rank as the length of the Ehrenfeucht game on non-isomorphic graphs. We use the separator theorems to design a winning strategy for Spoiler in this game.