Excluding the fork and antifork

Abstract The fork is the tree obtained from the claw K 1 , 3 by subdividing one of its edges once, and the antifork is its complement graph. We give a complete description of all graphs that do not contain the fork or antifork as induced subgraphs.