Pages that link to "Item:Q1098861"
From MaRDI portal
The following pages link to Fractional matchings and the Edmonds-Gallai theorem (Q1098861):
Displayed 8 items.
- On the computational complexity of upper fractional domination (Q753848) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Characterizations of maximum fractional \((g,f)\)-factors of graphs (Q947113) (← 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)
- Fractional matroid matchings (Q1812954) (← links)
- Maximal irredundant functions (Q1923617) (← links)
- Some Results on Fractional Graph Theory (Q5302745) (← links)