The perfect matchings without common edges in cubic graphs

zbMATH Open1299.05267MaRDI QIDQ4980958FDOQ4980958

Authors: Feng-Gen Lin 

Publication date: 30 June 2014

Recommendations

• scientific article; zbMATH DE number 1916558
• On a conjecture of Fan and Raspaud
• scientific article; zbMATH DE number 1916568
• scientific article; zbMATH DE number 5130820
• Sparsely intersecting perfect matchings in cubic graphs

zbMATH Keywords

cubic graphperfect matchingperfect matching polytope

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Perfect graphs (05C17)

Cited In (5)

• Perfect matchings with restricted intersection in cubic graphs
• Three matching intersection property for matching covered graphs
• \(\mathrm{SIG}\)-dimension conjecture proved for graphs having a perfect matching
• On intersection graphs of 2-matchings in cubic graphs
• Title not available (Why is that?)

This page was built for publication: The perfect matchings without common edges in cubic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4980958)