Pages that link to "Item:Q716178"
From MaRDI portal
The following pages link to On distance-3 matchings and induced matchings (Q716178):
Displaying 14 items.
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Maximum matching in multi-interface networks (Q393046) (← links)
- Induced matchings in subcubic graphs without short cycles (Q393187) (← links)
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- Two greedy consequences for maximum induced matchings (Q497673) (← links)
- Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
- Maximum induced matching problem on hhd-free graphs (Q765362) (← links)
- Exploiting hidden structure in selecting dimensions that distinguish vectors (Q899584) (← links)
- Locally searching for large induced matchings (Q1704586) (← links)
- Approximating weighted induced matchings (Q1752475) (← 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)
- Equality of distance packing numbers (Q2515579) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
