Pages that link to "Item:Q393187"
From MaRDI portal
The following pages link to Induced matchings in subcubic graphs without short cycles (Q393187):
Displaying 14 items.
- Strong chromatic index of subcubic planar multigraphs (Q499491) (← links)
- A lower bound on the acyclic matching number of subcubic graphs (Q1637156) (← links)
- Degenerate matchings and edge colorings (Q1706114) (← 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)
- 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)
- Acyclic matchings in graphs of bounded maximum degree (Q2138980) (← links)
- Approximating maximum uniquely restricted matchings in bipartite graphs (Q2322866) (← links)
- Induced Matchings in Graphs of Bounded Maximum Degree (Q2826215) (← 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)
