Pages that link to "Item:Q1637156"
From MaRDI portal
The following pages link to A lower bound on the acyclic matching number of subcubic graphs (Q1637156):
Displaying 9 items.
- Lower bounds on the uniquely restricted matching number (Q1733882) (← links)
- Approximating maximum acyclic matchings by greedy and local search strategies (Q2019502) (← links)
- Acyclic matchings in graphs of bounded maximum degree (Q2138980) (← links)
- On the hardness of deciding the equality of the induced and the uniquely restricted matching number (Q2414056) (← links)
- Uniquely restricted matchings in subcubic graphs (Q2416436) (← links)
- Acyclic matching in some subclasses of graphs (Q2680984) (← links)
- Acyclic Matching in Some Subclasses of Graphs (Q5041209) (← 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)