Berge-Fulkerson Conjecture
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]. The first printed appearance is in [1]. A good indication ...