Polyhedral Results for 1-Restricted Simple 2-Matchings
From MaRDI portal
Publication:3395008
Recommendations
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs
- A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges
- Maximum cardinality 1-restricted simple 2-matchings
- Integer Programming and Combinatorial Optimization
- Matching Problems in Polymatroids Without Double Circuits
- Results and open problems in matchings in regular graphs
- A minimax result for perfect matchings of a polyomino graph
- Perfect matchings and \(K_{1,p}\)-restricted graphs
- Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
- Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)
Cited in
(5)
This page was built for publication: Polyhedral Results for 1-Restricted Simple 2-Matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395008)