The perfect matching polytope and solid bricks

DOI10.1016/J.JCTB.2004.08.003zbMATH Open1055.05128OpenAlexW2094202793MaRDI QIDQ705886FDOQ705886

Authors: U. S. R. Murty, Marcelo H. de Carvalho, Cláudio L. Lucchesi 

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

Recommendations

• Matching structure and the matching lattice
• The perfectly matchable subgraph polytope of an arbitrary graph
• Perfect matching and polymatroids
• Perfect matchings versus odd cuts
• Dominants and submissives of matching polyhedra

zbMATH Keywords

perfect matching polytopeMatchingsBricks

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (21)

• On two unsolved problems concerning matching covered graphs
• The graph of perfect matching polytope and an extreme problem
• Nice pairs of disjoint pentagons in fullerene graphs
• Nice pairs of odd cycles in fullerene graphs
• Matching covered graphs with three removable classes
• On essentially 4-edge-connected cubic bricks
• Dimension of the perfect matching polytope of graphs
• Perfect matchings versus odd cuts
• Grid graphs, Gorenstein polytopes, and domino stackings
• How to build a brick
• A generalization of Little's theorem on Pfaffian orientations
• The cubic vertices of solid minimal bricks
• The perfectly matchable subgraph polytope of an arbitrary graph
• Matching structure and the matching lattice
• König-Egerváry graphs are non-Edmonds
• Birkhoff-von Neumann graphs that are PM-compact
• Graphs isomorphic to their maximum matching graphs
• Disjoint odd cycles in cubic solid bricks
• Relations between global forcing number and maximum anti-forcing number of a graph
• Dominants and submissives of matching polyhedra
• On the number of dissimilar pfaffian orientations of graphs

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

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