The following pages link to Induced matchings (Q1262877):
Displaying 50 items.
- Augmenting approach for some maximum set problems (Q284765) (← links)
- On graphs with induced matching number almost equal to matching number (Q324703) (← links)
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Maximum matching in multi-interface networks (Q393046) (← links)
- Induced matchings in subcubic graphs without short cycles (Q393187) (← links)
- Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302) (← 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)
- Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
- On the strong chromatic index of cubic Halin graphs (Q419099) (← links)
- Two greedy consequences for maximum induced matchings (Q497673) (← links)
- Maximum cardinality neighbourly sets in quadrilateral free graphs (Q511689) (← links)
- Complexity of simplicial homology and independence complexes of chordal graphs (Q679745) (← 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)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- Maximum induced matching problem on hhd-free graphs (Q765362) (← links)
- Packing \(r\)-cliques in weighted chordal graphs (Q817141) (← links)
- Complexity aspects of generalized Helly hypergraphs (Q845662) (← links)
- Induced matching extendable graph powers (Q855304) (← links)
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- The induced matching and chain subgraph cover problems for convex bipartite graphs (Q995582) (← links)
- Bipartite matching extendable graphs (Q998414) (← 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)
- Edge-deletable IM-extendable graphs with minimum number of edges (Q1045004) (← links)
- Brambles and independent packings in chordal graphs (Q1045070) (← links)
- The complexity of induced minors and related problems (Q1346772) (← links)
- Maximum induced matchings in graphs (Q1363677) (← 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)
- Characterization of the induced matching extendable graphs with \(2 n\) vertices and \(3 n\) edges (Q1699544) (← links)
- Degenerate matchings and edge colorings (Q1706114) (← links)
- On chordal graph and line graph squares (Q1752465) (← 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)
- 4-regular claw-free IM-extendable graphs (Q1781983) (← links)
- Finding a maximum induced matching in weakly chordal graphs (Q1810638) (← links)
- On maximum induced matchings in bipartite graphs (Q1847371) (← links)
