Pages that link to "Item:Q2416436"
From MaRDI portal
The following pages link to Uniquely restricted matchings in subcubic graphs (Q2416436):
Displaying 11 items.
- Uniquely restricted matchings and edge colorings (Q1687907) (← links)
- Approximating maximum acyclic matchings by greedy and local search strategies (Q2019502) (← links)
- A characterization of graphs with given maximum degree and smallest possible matching number (Q2032746) (← 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)
- On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs (Q2283036) (← links)
- Graphs in which some and every maximum matching is uniquely restricted (Q4553727) (← links)
- On Lower Bounds for the Matching Number of Subcubic Graphs (Q5272918) (← 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)
- Gated independence in graphs (Q6546421) (← links)