Abstract
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 | American English |
---|---|
Article number | 111786 |
Journal | Discrete Mathematics |
Volume | 343 |
Issue number | 5 |
DOIs | |
State | Published - May 2020 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
Keywords
- Antifork
- Forbidden induced subgraph
- Fork
- Graph structure