Pages that link to "Item:Q1762983"
From MaRDI portal
The following pages link to Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size (Q1762983):
Displaying 50 items.
- On graphs with induced matching number almost equal to matching number (Q324703) (← links)
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Maximum matching in multi-interface networks (Q393046) (← links)
- Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity (Q405058) (← links)
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- Prime graphs, matchings and the Castelnuovo-Mumford regularity (Q670634) (← 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)
- Maximum induced matching of hexagonal graphs (Q726519) (← links)
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← 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)
- Brambles and independent packings in chordal graphs (Q1045070) (← links)
- Locally searching for large induced matchings (Q1704586) (← links)
- Approximating weighted induced matchings (Q1752475) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- Sparse regular induced subgraphs in \(2P_3\)-free graphs (Q1799386) (← links)
- Finding a maximum induced matching in weakly chordal graphs (Q1810638) (← links)
- New results on induced matchings (Q1975379) (← links)
- Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
- Approximating maximum acyclic matchings by greedy and local search strategies (Q2019502) (← links)
- Maximum weight induced matching in some subclasses of bipartite graphs (Q2023124) (← links)
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← links)
- On the computational complexity of the Helly number in the \(P_3\) and related convexities (Q2132356) (← links)
- Acyclic matchings in graphs of bounded maximum degree (Q2138980) (← links)
- Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs (Q2283036) (← links)
- New kernels for several problems on planar graphs (Q2285156) (← links)
- On some hard and some tractable cases of the maximum acyclic matching problem (Q2288858) (← links)
- Maximum induced matchings close to maximum matchings (Q2348267) (← links)
- Moderately exponential time algorithms for the maximum induced matching problem (Q2355320) (← links)
- Exact algorithms for maximum induced matching (Q2407101) (← links)
- On the hardness of deciding the equality of the induced and the uniquely restricted matching number (Q2414056) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- Generalizing the induced matching by edge capacity constraints (Q2467130) (← 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)
- Induced Matching in Some Subclasses of Bipartite Graphs (Q2971661) (← links)
- Almost Induced Matching: Linear Kernels and Parameterized Algorithms (Q3181060) (← links)
- Squares of Intersection Graphs and Induced Matchings (Q3439440) (← links)
- Tree-Width and Optimization in Bounded Degree Graphs (Q3508553) (← links)
- Boundary Classes of Planar Graphs (Q3512606) (← links)
- Dominating Induced Matchings (Q3655141) (← links)
- On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
- Maximum Induced Matchings in Grids (Q4596162) (← links)
