$H$-colouring $P_t$-free graphs in subexponential time

Carla Groenland, Karolina Okrasa, Pawel Rzążewski +3

A graph is called $P_t$-free if it does not contain the path on $t$ vertices as an induced subgraph. Let $H$ be a multigraph with the property that any two distinct vertices share…