1 citations · 1 across the 1 of their papers we have counts for
1 paper
Maxim Babenko, Alexey Gusakov, Ilya Razenshteyn
A \emph{2-matching} in an undirected graph G=(VG,EG) is a function f:EG→{0,1,2} such that for each node v∈VG the sum of values f(e) on all edges e i…