Prefer a chat interface with context about you and your work?
Perfect Matching Covers of Cubic Graphs of Oddness 2
A perfect matching cover of a graph $G$ is a set of perfect matchings of $G$ such that each edge of $G$ is contained in at least one member of it. Berge conjectured that every bridgeless cubic graph has a perfect matching cover of order at most 5. The Berge …