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

DOI10.1016/j.tcs.2013.02.023zbMath1295.05189OpenAlexW2056053892WikidataQ123101258 ScholiaQ123101258MaRDI QIDQ390921

Xiumei Wang, Yanpei Liu

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)

Related Items (1)

Core index of perfect matching polytope for a 2-connected cubic graph

Cites Work

• Unnamed Item
• Fano colourings of cubic graphs and the Fulkerson conjecture
• Perfect matchings with restricted intersection in cubic graphs
• Brick decompositions and the matching rank of graphs
• Matching theory
• Integer flows and cycle covers
• Fulkerson's conjecture and circuit covers
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On a Conjecture of Fan and Raspaud
• Graphs with independent perfect matchings
• Rank of maximum matchings in a graph
• Combinatorial optimization. Theory and algorithms.

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