Pages that link to "Item:Q1810638"

The following pages link to Finding a maximum induced matching in weakly chordal graphs (Q1810638):

Displaying 45 items.

• Graphs with maximal induced matchings of the same size (Q344824) (← links)
• Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
• Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time (Q524382) (← 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)
• A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← 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)
• Brambles and independent packings in chordal graphs (Q1045070) (← links)
• Approximating weighted induced matchings (Q1752475) (← links)
• On the approximability of the maximum induced matching problem (Q1775017) (← links)
• A min-max property of chordal bipartite graphs with applications (Q1959718) (← links)
• Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
• Approximation of knapsack problems with conflict and forcing graphs (Q2012887) (← links)
• Maximum weight induced matching in some subclasses of bipartite graphs (Q2023124) (← links)
• On the induced matching problem in Hamiltonian bipartite graphs (Q2059914) (← links)
• The \(\text{v} \)-number of monomial ideals (Q2082536) (← 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)
• New kernels for several problems on planar graphs (Q2285156) (← 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)
• Perfectly matched sets in graphs: parameterized and exact computation (Q2697539) (← links)
• Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
• Induced Matching in Some Subclasses of Bipartite Graphs (Q2971661) (← links)
• On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
• Maximum Induced Matchings in Grids (Q4596162) (← links)
• (Q4691867) (← links)
• (Q4691905) (← links)
• (Q4691914) (← links)
• Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs (Q5025046) (← links)
• Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem (Q5131709) (← links)
• Maximum Induced Matching Algorithms via Vertex Ordering Characterizations (Q5136263) (← links)
• Recent progress on strong edge-coloring of graphs (Q5242836) (← links)
• Some bounds on the maximum induced matching numbers of certain grids (Q5383192) (← links)
• Induced Matchings in Graphs of Degree at Most 4 (Q5743551) (← links)
• On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)
• Induced matchings in strongly biconvex graphs and some algebraic applications (Q6081912) (← links)