The Dominating 4-Colour Theorem

António Girão, Freddie Illingworth, Bojan Mohar +6

A "dominating $K_t$-model" in a graph $G$ is a sequence $(T_1,\dots ,T_t)$ of pairwise vertex-disjoint connected subgraphs of $G$, such that whenever $1\le i<j\le t$ every vertex…