Core index of perfect matching polytope for a 2-connected cubic graph
From MaRDI portal
Publication:1692642
DOI10.7151/dmgt.2001zbMath1377.05155OpenAlexW2733825424MaRDI QIDQ1692642
Publication date: 10 January 2018
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2001
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Cites Work
- Unnamed Item
- Three-matching intersection conjecture for perfect matching polytopes of small dimensions
- Brick decompositions and the matching rank of graphs
- Matching theory
- Fulkerson's conjecture and circuit covers
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Graphs with independent perfect matchings
- Generation of Cubic Graphs and Snarks with Large Girth
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: Core index of perfect matching polytope for a 2-connected cubic graph