Pages that link to "Item:Q2065903"

The following pages link to A characterization of graphs with given maximum degree and smallest possible matching number. II (Q2065903):

Displaying 8 items.

• The maximum number of perfect matchings in graphs with a given degree sequence (Q1010667) (← links)
• Nordhaus-Gaddum type result for the matching number of a graph (Q1680497) (← links)
• Characterizations of maximum matching graphs of certain types (Q1772424) (← links)
• A characterization of graphs with given maximum degree and smallest possible matching number (Q2032746) (← links)
• Matching and edge-connectivity in graphs with given maximum degree (Q2032857) (← links)
• A generalization of Petersen's matching theorem (Q2111920) (← links)
• Cubic graphs with equal independence number and matching number (Q2219968) (← links)
• The relation of matching with inverse degree of a graph (Q2581633) (← links)