Pages that link to "Item:Q4979850"

The following pages link to Induced Matchings in Subcubic Graphs (Q4979850):

Displaying 19 items.

• Total dominating sequences in graphs (Q267175) (← links)
• A stronger bound for the strong chromatic index (extended abstract) (Q322242) (← links)
• Two greedy consequences for maximum induced matchings (Q497673) (← links)
• Strong chromatic index of subcubic planar multigraphs (Q499491) (← links)
• A lower bound on the acyclic matching number of subcubic graphs (Q1637156) (← links)
• Total dominating sequences in trees, split graphs, and under modular decomposition (Q1662158) (← 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)
• Acyclic matchings in graphs of bounded maximum degree (Q2138980) (← links)
• Minimum maximal matchings in cubic graphs (Q2144321) (← links)
• Perfect Italian domination on planar and regular graphs (Q2197486) (← links)
• Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier (Q2218644) (← links)
• Approximating maximum uniquely restricted matchings in bipartite graphs (Q2322866) (← links)
• Induced Matchings in Graphs of Bounded Maximum Degree (Q2826215) (← links)
• A Stronger Bound for the Strong Chromatic Index (Q4601050) (← links)
• Recent progress on strong edge-coloring of graphs (Q5242836) (← links)
• Induced Matchings in Graphs of Degree at Most 4 (Q5743551) (← links)