Pages that link to "Item:Q1414582"
From MaRDI portal
The following pages link to Induced matchings in asteroidal triple-free graphs (Q1414582):
Displaying 32 items.
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
- 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)
- The induced separation dimension of a graph (Q722529) (← links)
- Maximum induced matching problem on hhd-free graphs (Q765362) (← links)
- On orthogonal ray trees (Q908312) (← 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)
- Brambles and independent packings in chordal graphs (Q1045070) (← links)
- Induced matchings in intersection graphs. (Q1427466) (← links)
- Approximating weighted induced matchings (Q1752475) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- Finding a maximum induced matching in weakly chordal graphs (Q1810638) (← links)
- A min-max property of chordal bipartite graphs with applications (Q1959718) (← links)
- Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← links)
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- Moderately exponential time algorithms for the maximum induced matching problem (Q2355320) (← links)
- Equality of distance packing numbers (Q2515579) (← links)
- The graphs with maximum induced matching and maximum matching the same size (Q2568473) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
- (Q4691867) (← links)
- Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs (Q5025046) (← links)
- Maximum Induced Matching Algorithms via Vertex Ordering Characterizations (Q5136263) (← links)
- Recent progress on strong edge-coloring of graphs (Q5242836) (← links)
- Induced Matchings in Graphs of Degree at Most 4 (Q5743551) (← links)
- (Q5869351) (← links)
