Perfect matchings with restricted intersection in cubic graphs

DOI10.1016/j.ejc.2009.11.007zbMath1218.05137OpenAlexW1989226131MaRDI QIDQ976153

Tomáš Kaiser, Andre Raspaud

Publication date: 17 June 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.11.007

zbMATH Keywords

bridgeless cubic graphthree perfect matchings with empty intersection

Mathematics Subject Classification ID

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

Related Items (9)

Three-matching intersection conjecture for perfect matching polytopes of small dimensions ⋮ Covering a cubic graph with perfect matchings ⋮ Sparsely intersecting perfect matchings in cubic graphs ⋮ Cores, joins and the Fano-flow conjectures ⋮ Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching ⋮ An equivalent formulation of the Fan-Raspaud Conjecture and related problems ⋮ Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction ⋮ Treelike snarks ⋮ Berge-Fulkerson coloring for some families of superposition snarks

Cites Work

• Sparsely intersecting perfect matchings in cubic graphs
• Fano colourings of cubic graphs and the Fulkerson conjecture
• Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
• Fulkerson's conjecture and circuit covers
• Colouring of cubic graphs by Steiner triple systems
• On a Conjecture of Fan and Raspaud
• Blocking and anti-blocking pairs of polyhedra
• Unnamed Item
• Unnamed Item

This page was built for publication: Perfect matchings with restricted intersection in cubic graphs