Pages that link to "Item:Q1098861"
From MaRDI portal
The following pages link to Fractional matchings and the Edmonds-Gallai theorem (Q1098861):
Displaying 23 items.
- Efficient stabilization of cooperative matching games (Q526875) (← links)
- On the computational complexity of upper fractional domination (Q753848) (← links)
- Spectral aspects of symmetric matrix signings (Q783041) (← links)
- On certain classes of fractional matchings (Q798265) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Finding small stabilizers for unstable graphs (Q896265) (← links)
- Characterizations of maximum fractional \((g,f)\)-factors of graphs (Q947113) (← links)
- Maximal tight sets and the Edmonds-Gallai decomposition for matchings (Q1086254) (← links)
- A structure theorem for maximum internal matchings in graphs (Q1183490) (← links)
- Minimum spectral radius of a weighted graph (Q1188417) (← links)
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance (Q1343143) (← links)
- Integer \(k\)-matchings of graphs (Q1682886) (← links)
- The strength of Dantzig-Wolfe reformulations for the stable set and related problems (Q1756353) (← links)
- Fractional matroid matchings (Q1812954) (← links)
- Maximal irredundant functions (Q1923617) (← links)
- Fractional Gallai-Edmonds decomposition and maximal graphs on fractional matching number (Q2185816) (← links)
- Tractability of König edge deletion problems (Q2333799) (← links)
- Kidney exchange: further utilization of donors via listed exchange (Q2444699) (← links)
- A Gallai–Edmonds‐type structure theorem for path‐matchings (Q4474277) (← links)
- Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
- Spanning Trees with Few Branch Vertices (Q5232165) (← links)
- Some Results on Fractional Graph Theory (Q5302745) (← links)
- An improvement on Łuczak's connected matchings method (Q6133269) (← links)
