The following pages link to New results on induced matchings (Q1975379):
Displayed 20 items.
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
- The induced matching and chain subgraph cover problems for convex bipartite graphs (Q995582) (← links)
- Efficient edge domination in regular graphs (Q1005253) (← links)
- Maximum induced matchings for chordal graphs in linear time (Q1018044) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- Some results on graphs without long induced paths (Q1029004) (← links)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- Induced matchings in intersection graphs. (Q1427466) (← links)
- On the computational complexity of strong edge coloring (Q1602692) (← links)
- Maximum induced matchings of random cubic graphs (Q1612292) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- Generalized subgraph-restricted matchings in graphs (Q1779490) (← links)
- Finding a maximum induced matching in weakly chordal graphs (Q1810638) (← links)
- On maximum induced matchings in bipartite graphs (Q1847371) (← links)
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062) (← links)
- Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
- The graphs with maximum induced matching and maximum matching the same size (Q2568473) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- Squares of Intersection Graphs and Induced Matchings (Q3439440) (← links)
- Tree-Width and Optimization in Bounded Degree Graphs (Q3508553) (← links)