1 paper
Andrey A. Dobrynin, Aleksey N. Glebov
A graph is subcubic if it is connected and its maximum vertex degree does not exceed 3. Two disjoint vertex subsets of a graph G form a connected coalition in G if neither of t…