A strong matching C in a graph G is a matching C such that there is no edge of E(G) connecting any two edges of C. A cubic graph G is a Jaeger's graph if it ...
確定! 回上一頁