The following pages link to Perfect triangle-free 2-matchings (Q3905324):
Displaying 16 items.
- A model for minimizing active processor time (Q487001) (← links)
- Induced graph packing problems (Q604669) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Structural properties of matroid matchings (Q1199466) (← links)
- Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles (Q1637143) (← links)
- A fast scaling algorithm for the weighted triangle-free 2-matching problem (Q1678085) (← links)
- Solving the linear matroid parity problem as a sequence of matroid intersection problems (Q1813836) (← links)
- Applying Lehman's theorems to packing problems (Q1919808) (← 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)
- Dynamic matchings and quasidynamic fractional matchings. II (Q3040951) (← links)
- TRIANGLE-FREE 2-MATCHINGS REVISITED (Q3084696) (← links)
- Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
- Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles (Q5041752) (← links)
- Remarks on component factors (Q6093996) (← links)
- Node based compact formulations for the Hamiltonian <i>p</i>‐median problem (Q6180025) (← links)
