The perfect matching index of a cubic graph $G$, denoted by $\pi(G)$, is the smallest number of perfect matchings that cover all the edges of $G$.
確定! 回上一頁