The following pages link to New results on induced matchings (Q1975379):
Displayed 50 items.
- A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem (Q336528) (← links)
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Maximum matching in multi-interface networks (Q393046) (← links)
- Matchings, coverings, and Castelnuovo-Mumford regularity (Q405389) (← links)
- Strong edge-coloring for cubic Halin graphs (Q408187) (← links)
- The strong chromatic index of Halin graphs (Q411659) (← links)
- On the strong chromatic index of cubic Halin graphs (Q419099) (← 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 of hexagonal graphs (Q726519) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← 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)
- 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)
- 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)
- Induced matchings in intersection graphs. (Q1427466) (← links)
- On the computational complexity of strong edge coloring (Q1602692) (← links)
- Maximum induced matchings of random cubic graphs (Q1612292) (← links)
- Upper bounds for the strong chromatic index of Halin graphs (Q1692620) (← 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)
- Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
- Maximum weight induced matching in some subclasses of bipartite graphs (Q2023124) (← links)
- Number of induced matchings of graphs (Q2025191) (← links)
- Proof of a conjecture on the strong chromatic index of Halin graphs (Q2043362) (← links)
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← links)
- A characterization of well-indumatchable graphs having girth greater than seven (Q2172407) (← links)
- Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
- Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
- New kernels for several problems on planar graphs (Q2285156) (← links)
- Exact algorithms for maximum induced matching (Q2407101) (← links)
- Strong edge chromatic index of the generalized Petersen graphs (Q2423067) (← links)
- Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
- Strong edge-coloring for jellyfish graphs (Q2515576) (← 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)