The following pages link to (Q3139292):
Displaying 33 items.
- On distance-3 matchings and induced matchings (Q716178) (← links)
- Maximum induced matching of hexagonal graphs (Q726519) (← links)
- Maximum induced matching problem on hhd-free graphs (Q765362) (← links)
- 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)
- 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)
- Brambles and independent packings in chordal graphs (Q1045070) (← links)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- Approximating weighted induced matchings (Q1752475) (← 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)
- A min-max property of chordal bipartite graphs with applications (Q1959718) (← links)
- New results on induced matchings (Q1975379) (← links)
- Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
- New kernels for several problems on planar graphs (Q2285156) (← links)
- Moderately exponential time algorithms for the maximum induced matching problem (Q2355320) (← links)
- Linear time algorithms for generalized edge dominating set problems (Q2480902) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree (Q3439421) (← links)
- Squares of Intersection Graphs and Induced Matchings (Q3439440) (← links)
- On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
- (Q4691867) (← links)
- (Q4691905) (← links)
- (Q4691914) (← links)
- Well-indumatched Trees and Graphs of Bounded Girth (Q5060441) (← links)
- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem (Q5131709) (← links)
- (Q5869351) (← links)
