4 citations · 6 across the 6 of their papers we have counts for
1 paper · 1 filter
Edita Máčajová, Martin Škoviera
The perfect matching index of a cubic graph G, denoted by π(G), is the smallest number of perfect matchings that cover all the edges of G. According to the Berge-Fulkerson co…