Pages that link to "Item:Q1849530"
From MaRDI portal
The following pages link to Matching, matroids, and extensions (Q1849530):
Displaying 35 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 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)
- On the maximum even factor in weakly symmetric graphs (Q598466) (← links)
- On matroid parity and matching polytopes (Q777400) (← links)
- Optimal matchings in posets (Q792355) (← links)
- A weighted even factor algorithm (Q948958) (← links)
- Submodular function minimization (Q995782) (← links)
- Structural properties of matroid matchings (Q1199466) (← links)
- The optimal path-matching problem (Q1272178) (← links)
- Characterizing matchings as the intersection of matroids (Q1416794) (← links)
- Matchings and matching extensions in graphs (Q1584277) (← links)
- First steps in combinatorial optimization on graphons: matchings (Q1689941) (← links)
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs (Q1751242) (← links)
- Improved algorithms for even factors and square-free simple \(b\)-matchings (Q1934309) (← links)
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles (Q2118149) (← links)
- Extendability and criticality in matching theory (Q2175791) (← links)
- Decomposition theorems for square-free 2-matchings in bipartite graphs (Q2410265) (← links)
- A weighted independent even factor algorithm (Q2429469) (← links)
- Matchings of cycles and paths in directed graphs (Q2460633) (← links)
- Matroid matching with Dilworth truncation (Q2476281) (← links)
- Finding maximum square-free 2-matchings in bipartite graphs (Q2498740) (← links)
- Even factors, jump systems, and discrete convexity (Q2519019) (← links)
- Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs (Q2827824) (← links)
- Matroid matching: the power of local search (Q2875164) (← links)
- Matching as the Intersection of Matroids (Q3438958) (← links)
- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs (Q3503840) (← links)
- Matching Extendability in Hypercubes (Q3583324) (← links)
- (Q4379742) (← links)
- (Q4938474) (← links)
- Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles (Q5041752) (← links)
- Filtered matchings and simplicial complexes (Q5080926) (← links)
- Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids (Q6180564) (← links)
- Finding triangle-free 2-factors in general graphs (Q6540256) (← links)