Pages that link to "Item:Q2032746"
From MaRDI portal
The following pages link to A characterization of graphs with given maximum degree and smallest possible matching number (Q2032746):
Displaying 5 items.
- Characterizations of maximum matching graphs of certain types (Q1772424) (← links)
- A characterization of graphs with given maximum degree and smallest possible matching number. II (Q2065903) (← links)
- A generalization of Petersen's matching theorem (Q2111920) (← links)
- Tight lower bounds on the matching number in a graph with given maximum degree (Q4553732) (← links)
- A characterization of the subcubic graphs achieving equality in the Haxell‐Scott lower bound for the matching number (Q6055403) (← links)