On cubic graphs having the maximal coalition number

Andrey A. Dobrynin, Hamidreza Golmohammadi

A coalition in a graph $G$ with vertex set $V$ consists of two disjoint sets $V_1,V_2\subset V$ such that neither $V_1$ nor $V_2$ is a dominating set, but the union $V_1\cup V_2$…