Pages that link to "Item:Q4474277"
From MaRDI portal
The following pages link to A Gallai–Edmonds‐type structure theorem for path‐matchings (Q4474277):
Displaying 4 items.
- On the maximum even factor in weakly symmetric graphs (Q598466) (← links)
- A weighted even factor algorithm (Q948958) (← links)
- A weighted independent even factor algorithm (Q2429469) (← links)
- Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids (Q5067424) (← links)
