Pages that link to "Item:Q2078840"
From MaRDI portal
The following pages link to Nordhaus-Gaddum type inequality for the fractional matching number of a graph (Q2078840):
Displaying 4 items.
- The difference and ratio of the fractional matching number and the matching number of graphs (Q906487) (← links)
- Nordhaus-Gaddum type result for the matching number of a graph (Q1680497) (← links)
- Sharp lower bounds on the fractional matching number (Q2345617) (← links)
- Nordhaus-Gaddum type inequality for the integer \(k\)-matching number of a graph (Q6094709) (← links)