Critical $(P_5,dart)$-Free Graphs

Wen Xia, Jorik Jooken, Jan Goedgebeur +1

Given two graphs $H_1$ and $H_2$, a graph is $(H_1,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ nor $H_2$. Let $P_t$ be the path on $t$ vertices. A dart is the…