Matchings in regular graphs

DOI10.1016/0012-365X(81)90006-6zbMath0466.05054OpenAlexW2032495288MaRDI QIDQ1155070

Denis Naddef, William R. Pulleyblank

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(81)90006-6

zbMATH Keywords

perfect matchingsmatching polytope

Mathematics Subject Classification ID

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

Related Items

Matching connectivity: on the structure of graphs with perfect matchings, Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices, The traveling salesman problem on cubic and subcubic graphs, TSP on Cubic and Subcubic Graphs, Largest 2-regular subgraphs in 3-regular graphs, Minimum-weight two-connected spanning networks, A generalization of Petersen's theorem, A note on cyclic connectivity and matching properties of regular graphs, Circulant association schemes on triples, An Improved Analysis of the Mömke--Svensson Algorithm for Graph-TSP on Subquartic Graphs, Derangement action digraphs and graphs, Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes, Short proofs on the matching polyhedron, Ear-decompositions of matching-covered graphs, Brick decompositions and the matching rank of graphs, Unnamed Item

Cites Work

• On defect-d matchings in graphs
• Rank of maximum matchings in a graph
• Graph Theory and Integer Programming
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• On the structure of factorizable graphs
• The Factorization of Linear Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item