Pages that link to "Item:Q2826215"
From MaRDI portal
The following pages link to Induced Matchings in Graphs of Bounded Maximum Degree (Q2826215):
Displaying 11 items.
- A lower bound on the acyclic matching number of subcubic graphs (Q1637156) (← links)
- Lower bounds on the uniquely restricted matching number (Q1733882) (← links)
- Approximating weighted induced matchings (Q1752475) (← links)
- Approximating maximum acyclic matchings by greedy and local search strategies (Q2019502) (← links)
- The \(\text{v} \)-number of monomial ideals (Q2082536) (← links)
- Acyclic matchings in graphs of bounded maximum degree (Q2138980) (← links)
- Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier (Q2218644) (← links)
- A Stronger Bound for the Strong Chromatic Index (Q4601050) (← links)
- Recent progress on strong edge-coloring of graphs (Q5242836) (← links)
- Some bounds on the maximum induced matching numbers of certain grids (Q5383192) (← links)
- Induced Matchings in Graphs of Degree at Most 4 (Q5743551) (← links)
