  We prove that a graph G contains no induced four-edge path and no induced
complement of a four-edge path if and only if G is obtained from five-cycles
and split graphs by repeatedly applying the following operations: substitution,
split graph unification, and split graph unification in the complement ("split
graph unification" is a new class-preserving operation that is introduced in
this paper).
