Critical $(P_5,W_4)$-Free Graphs

Wen Xia, Jorik Jooken, Jan Goedgebeur +3

A graph $G$ is $k$-vertex-critical if $\ddot{I}‡(G)=k$ but $\ddot{I}‡(G-v)<k$ for all $v\in V(G)$. A graph is $(H_1,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ nor $H_2$…