Pages that link to "Item:Q4722104"
From MaRDI portal
The following pages link to Maximum matchings in a regular graph of specified connectivity and bounded order (Q4722104):
Displaying 10 items.
- Matching and edge-connectivity in regular graphs (Q616391) (← links)
- On the perfect matchings of near regular graphs (Q659743) (← links)
- On maximal matchings of connected graphs (Q812460) (← links)
- Maximum matchings in regular graphs of high girth (Q870087) (← links)
- Matching and edge-connectivity in graphs with given maximum degree (Q2032857) (← links)
- A generalization of Petersen's matching theorem (Q2111920) (← links)
- Tight lower bounds on the size of a maximum matching in a regular graph (Q2478167) (← links)
- Cut-edges and regular factors in regular graphs of odd degree (Q2657077) (← links)
- The maximum valency of regular graphs with given order and odd girth (Q4013422) (← links)
- A complete description of convex sets associated with matchings and edge‐connectivity in graphs (Q6046646) (← links)