Triangle-Free 2-Matchings Revisited

Maxim Babenko, Alexey Gusakov, Ilya Razenshteyn

A \emph{2-matching} in an undirected graph $G=(VG,EG)$ is a function $f:EG\to \{0,1,2\}$ such that for each node $v\in VG$ the sum of values $f(e)$ on all edges $e$ i…