Excluding the fork and antifork
arXiv:2408.15005 · doi:10.1016/j.disc.2019.111786
Abstract
The fork is the tree obtained from the claw 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.
This is an old paper. It was published in 2020 in Discrete Math where it was awarded Editors' choice