Pages that link to "Item:Q4553732"
From MaRDI portal
The following pages link to Tight lower bounds on the matching number in a graph with given maximum degree (Q4553732):
Displaying 13 items.
- Lower bounds on the uniquely restricted matching number (Q1733882) (← 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 tight lower bound on the matching number of graphs via Laplacian eigenvalues (Q2066004) (← links)
- A generalization of Petersen's matching theorem (Q2111920) (← links)
- Transversals and independence in linear hypergraphs with maximum degree two (Q2363113) (← links)
- Uniquely restricted matchings in subcubic graphs (Q2416436) (← links)
- Building large \(k\)-cores from sparse graphs (Q2678255) (← links)
- (Q5089202) (← links)
- A complete description of convex sets associated with matchings and edge‐connectivity in graphs (Q6046646) (← links)
- A characterization of the subcubic graphs achieving equality in the Haxell‐Scott lower bound for the matching number (Q6055403) (← links)
- Uniquely restricted matchings in subcubic graphs without short cycles (Q6055410) (← links)