how am i going to prove that a graph (say 3-connected cubic graph) admits a path partition?