Trisimplicial vertices in (fork, odd parachute)-free graphs

Kaiyang Lan, Feng Liu, Di Wu +1

An {\em odd hole} in a graph is an induced subgraph which is a cycle of odd length at least five. An {\em odd parachute} is a graph obtained from an odd hole $H$ by adding a new ed…