The perfect matching polytope and solid bricks

DOI10.1016/j.jctb.2004.08.003zbMath1055.05128OpenAlexW2094202793MaRDI QIDQ705886

U. S. R. Murty, Cláudio Leonardo Lucchesi, Marcelo H. De Carvalho

Publication date: 16 February 2005

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2004.08.003

zbMATH Keywords

perfect matching polytopeMatchingsBricks

Mathematics Subject Classification ID

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

Related Items (15)

Nice pairs of disjoint pentagons in fullerene graphs ⋮ Nice pairs of odd cycles in fullerene graphs ⋮ On Two Unsolved Problems Concerning Matching Covered Graphs ⋮ Grid graphs, Gorenstein polytopes, and domino stackings ⋮ König-Egerváry graphs are non-Edmonds ⋮ A generalization of Little's theorem on Pfaffian orientations ⋮ Matching covered graphs with three removable classes ⋮ The cubic vertices of solid minimal bricks ⋮ How to build a brick ⋮ Birkhoff--von Neumann Graphs that are PM-Compact ⋮ Disjoint Odd Cycles in Cubic Solid Bricks ⋮ On the number of dissimilar pfaffian orientations of graphs ⋮ On essentially 4-edge-connected cubic bricks ⋮ Relations between global forcing number and maximum anti-forcing number of a graph ⋮ Graphs isomorphic to their maximum matching graphs

Cites Work

• Matching theory
• Matching structure and the matching lattice
• On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
• On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic
• Maximum matching and a polyhedron with 0,1-vertices
• The Factorization of Linear Graphs

This page was built for publication: The perfect matching polytope and solid bricks