Pages that link to "Item:Q429657"
From MaRDI portal
The following pages link to A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs (Q429657):
Displaying 12 items.
- Triangle-free 2-matchings and M-concave functions on jump systems (Q401132) (← links)
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems (Q444382) (← links)
- An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs (Q448969) (← 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)
- Positive planar satisfiability problems under 3-connectivity constraints (Q2143145) (← 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)
- Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles (Q5041752) (← links)
- Finding triangle-free 2-factors in general graphs (Q6540256) (← links)
