Matchings in regular graphs

DOI10.1016/0012-365X(81)90006-6zbMath0466.05054MaRDI 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 matchings; matching polytope

Mathematics Subject Classification ID

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

Related Items

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

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