Three-matching intersection conjecture for perfect matching polytopes of small dimensions

DOI10.1016/J.TCS.2013.02.023MaRDI QIDQ390921zbMATH OpenOpenAlexWikidataFDO

Authors Xiumei Wang, Yixun Lin

Publication date 9 January 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2013.02.023

zbMATH Keywords

cubic graphperfect matchingFulkerson's conjecture

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1916558
• Perfect matchings with restricted intersection in cubic graphs
• Sparsely intersecting perfect matchings in cubic graphs
• Three matching intersection property for matching covered graphs
• scientific article; zbMATH DE number 1916568

Cites work

• scientific article; zbMATH DE number 4075098 (Why is no real title available?)
• Brick decompositions and the matching rank of graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Combinatorial optimization. Theory and algorithms.
• Fano colourings of cubic graphs and the Fulkerson conjecture
• Fulkerson's conjecture and circuit covers
• Graphs with independent perfect matchings
• Integer flows and cycle covers
• Matching theory
• On a conjecture of Fan and Raspaud
• Perfect matchings with restricted intersection in cubic graphs
• Rank of maximum matchings in a graph

Cited in

(2)

• Three matching intersection property for matching covered graphs
• Core index of perfect matching polytope for a 2-connected cubic graph

This page was built for publication: Three-matching intersection conjecture for perfect matching polytopes of small dimensions

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