Suppose the sparsity pattern of $A \in \mathbb{R}^{N \times N}$ is a planar graph. Can I use this to bound the complexity of solving

$$ Ax = b $$ ?

In particular, I was hoping to use the planar separator theorem to produce an elimination ordering that would give an $O(N \sqrt N)$ factorization time.