Three matching intersection property for matching covered graphs
From MaRDI portal
Abstract: In connection with Fulkerson's conjecture on cycle covers, Fan and Raspaud proposed a weaker conjecture: For every bridgeless cubic graph , there are three perfect matchings , , and such that . We call the property specified in this conjecture the three matching intersection property (and 3PM property for short). We study this property on matching covered graphs. The main results are a necessary and sufficient condition and its applications to characterization of special graphs, such as the Halin graphs and 4-regular graphs.
Recommendations
- scientific article; zbMATH DE number 1916558
- The perfect matchings without common edges in cubic graphs
- scientific article; zbMATH DE number 1916568
- An equivalent formulation of the Fan-Raspaud conjecture and related problems
- Three-matching intersection conjecture for perfect matching polytopes of small dimensions
Cited in
(5)- An equivalent formulation of the Fan-Raspaud conjecture and related problems
- On intersection graphs of 2-matchings in cubic graphs
- Three-matching intersection conjecture for perfect matching polytopes of small dimensions
- scientific article; zbMATH DE number 1916568 (Why is no real title available?)
- Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs
This page was built for publication: Three matching intersection property for matching covered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4560217)