Covering minimal separators and potential maximal cliques in $P_t$-free graphs

Andrzej Grzesik, Tereza Klimošová, Marcin Pilipczuk +1

A graph is called $P_t$-free} if it does not contain a $t$-vertex path as an induced subgraph. While $P_4$-free graphs are exactly cographs, the structure of $P_t$-free graphs for…