Pages that link to "Item:Q1810638"
From MaRDI portal
The following pages link to Finding a maximum induced matching in weakly chordal graphs (Q1810638):
Displayed 13 items.
- On distance-3 matchings and induced matchings (Q716178) (← links)
- On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179) (← 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)
- Brambles and independent packings in chordal graphs (Q1045070) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- A min-max property of chordal bipartite graphs with applications (Q1959718) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- The graphs with maximum induced matching and maximum matching the same size (Q2568473) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)