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 G, there are three perfect matchings M1, M2, and M3 such that M1capM2capM3=emptyset. 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.












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)