Pages that link to "Item:Q2075471"
From MaRDI portal
The following pages link to A note on maximum fractional matchings of graphs (Q2075471):
Displaying 6 items.
- The difference and ratio of the fractional matching number and the matching number of graphs (Q906487) (← links)
- Fractional matchings and the Edmonds-Gallai theorem (Q1098861) (← links)
- Nordhaus-Gaddum type inequality for the fractional matching number of a graph (Q2078840) (← links)
- Fractional Gallai-Edmonds decomposition and maximal graphs on fractional matching number (Q2185816) (← links)
- Sharp lower bounds on the fractional matching number (Q2345617) (← links)
- Fractional matching preclusion numbers of Cartesian product graphs (Q6110597) (← links)