Three remarks on ${\mathbf{W}}_2$ graphs

Carl Feghali, Malory Marin

Let $k\ge 1$. A graph $G$ is ${\mathbf{W}}_{\mathbf{k}}$ if for any $k$ pairwise disjoint independent vertex subsets $A_1,\dots ,A_k$ in $G$, there exist $k$ pairwise disjoint maximum indepe…