Pages that link to "Item:Q1949271"
From MaRDI portal
The following pages link to Polyhedron of triangle-free simple 2-matchings in subcubic graphs (Q1949271):
Displaying 16 items.
- A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs (Q429657) (← links)
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems (Q444382) (← links)
- Core index of perfect matching polytope for a 2-connected cubic graph (Q1692642) (← links)
- A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges (Q2032181) (← links)
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles (Q2118149) (← links)
- Decomposition theorems for square-free 2-matchings in bipartite graphs (Q2410265) (← links)
- When the Gomory-chvátal closure coincides with the integer hull (Q2417111) (← links)
- Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs (Q2827824) (← links)
- Maximum Cardinality Simple 2-matchings in Subcubic Graphs (Q3105789) (← links)
- Polyhedral Results for 1-Restricted Simple 2-Matchings (Q3395008) (← links)
- Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
- Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles (Q5041752) (← links)
- Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids (Q5067424) (← links)
- Integer Programming and Combinatorial Optimization (Q5712449) (← links)
- Finding triangle-free 2-factors in general graphs (Q6540256) (← links)
- Approximations for the Steiner multicycle problem (Q6634374) (← links)
