Graph partitioning and bisection represent fundamental questions in combinatorial optimisation, concerned with dividing the vertices of a graph into disjoint subsets while balancing size constraints ...
Conjecture (Berge and Fulkerson): Every 2-connected cubic graph has a collection of six perfect matchings that together cover every edge exactly twice. This conjecture is attributed to Berge in [2].
Some results have been hidden because they may be inaccessible to you
Show inaccessible results