The fork is the tree obtained from the claw K1,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.
|Original language||English (US)|
|State||Published - May 2020|
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Forbidden induced subgraph
- Graph structure