The following pages link to Matchings in regular graphs (Q1155070):
Displaying 16 items.
- Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices (Q408370) (← links)
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- A note on cyclic connectivity and matching properties of regular graphs (Q742609) (← links)
- Short proofs on the matching polyhedron (Q1050377) (← links)
- Ear-decompositions of matching-covered graphs (Q1052341) (← links)
- Brick decompositions and the matching rank of graphs (Q1055426) (← links)
- Matching connectivity: on the structure of graphs with perfect matchings (Q1689965) (← links)
- A generalization of Petersen's theorem (Q1801707) (← links)
- Largest 2-regular subgraphs in 3-regular graphs (Q2000571) (← links)
- Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes (Q2067494) (← links)
- Derangement action digraphs and graphs (Q2311379) (← links)
- The traveling salesman problem on cubic and subcubic graphs (Q2452378) (← links)
- TSP on Cubic and Subcubic Graphs (Q3009751) (← links)
- Circulant association schemes on triples (Q3380353) (← links)
- An Improved Analysis of the Mömke--Svensson Algorithm for Graph-TSP on Subquartic Graphs (Q5220466) (← links)
- (Q5743492) (← links)
