  We introduce the standard decomposition, a way of decomposing a labeled graph
into a sum of certain labeled subgraphs. We motivate this graph-theoretic
concept by relating it to Connect Four decompositions of standard sets. We
prove that all standard decompositions can be generated in polynomial time,
which implies that all Connect Four decompositions can be generated in
polynomial time.
