Pages that link to "Item:Q1427466"
From MaRDI portal
The following pages link to Induced matchings in intersection graphs. (Q1427466):
Displaying 50 items.
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Induced matchings in subcubic graphs without short cycles (Q393187) (← links)
- Matchings, coverings, and Castelnuovo-Mumford regularity (Q405389) (← links)
- Two greedy consequences for maximum induced matchings (Q497673) (← 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)
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818) (← 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)
- 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)
- Degenerate matchings and edge colorings (Q1706114) (← links)
- Approximating weighted induced matchings (Q1752475) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- The \(k\)-regular induced subgraph problem (Q1786867) (← links)
- Algorithms for induced biclique optimization problems (Q1944925) (← links)
- A min-max property of chordal bipartite graphs with applications (Q1959718) (← links)
- Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
- On the induced matching problem in Hamiltonian bipartite graphs (Q2059914) (← links)
- The \(\text{v} \)-number of monomial ideals (Q2082536) (← 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)
- On some hard and some tractable cases of the maximum acyclic matching problem (Q2288858) (← links)
- Approximating maximum uniquely restricted matchings in bipartite graphs (Q2322866) (← links)
- Moderately exponential time algorithms for the maximum induced matching problem (Q2355320) (← links)
- 3D-interval-filament graphs (Q2462403) (← links)
- Equality of distance packing numbers (Q2515579) (← links)
- The graphs with maximum induced matching and maximum matching the same size (Q2568473) (← links)
- Perfectly matched sets in graphs: parameterized and exact computation (Q2697539) (← links)
- Algorithms on Subtree Filament Graphs (Q3655136) (← links)
- On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
- A Faster Algorithm for Maximum Induced Matchings on Circle Graphs (Q4585063) (← links)
- Maximum Induced Matchings in Grids (Q4596162) (← links)
- (Q4691867) (← links)
- Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings (Q5063275) (← links)
- A faster algorithm for maximum independent set on interval filament graphs (Q5084714) (← 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)
- Parameterized complexity of perfectly matched sets (Q6038698) (← links)
- On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)
- Maximum max-k-clique subgraphs in cactus subtree graphs (Q6132893) (← links)
- Well-indumatched pseudoforests (Q6657223) (← links)