Pages that link to "Item:Q6055403"
From MaRDI portal
The following pages link to A characterization of the subcubic graphs achieving equality in the Haxell‐Scott lower bound for the matching number (Q6055403):
Displaying 7 items.
- A lower bound on the acyclic matching number of subcubic graphs (Q1637156) (← 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 characterization of graphs with given maximum degree and smallest possible matching number. II (Q2065903) (← links)
- A generalization of Petersen's matching theorem (Q2111920) (← links)
- Cubic graphs with equal independence number and matching number (Q2219968) (← links)
- On Lower Bounds for the Matching Number of Subcubic Graphs (Q5272918) (← links)