Dominating Hadwiger's Conjecture holds for all $2K_2$-free graphs
Authors
Zi-Xia Song
Thomas Tibbetts
Abstract
A dominating $K_t$ minor in a graph $G$ is a sequence $(T_1,\dots,T_t)$ of pairwise disjoint non-empty connected subgraphs of $G$, such that for $1 \leq i
