Excluding the fork and antifork

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.
Comment: This is an old paper. It was published in 2020 in Discrete Math where it was awarded Editors' choice