Pages that link to "Item:Q1951557"
From MaRDI portal
The following pages link to New results on maximum induced matchings in bipartite graphs and beyond (Q1951557):
Displaying 31 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)
- Two greedy consequences for maximum induced matchings (Q497673) (← links)
- The micro-world of cographs (Q831855) (← links)
- Locally searching for large induced matchings (Q1704586) (← links)
- Approximating weighted induced matchings (Q1752475) (← links)
- On maximum induced matchings in bipartite graphs (Q1847371) (← links)
- On the induced matching problem in Hamiltonian bipartite graphs (Q2059914) (← links)
- Acyclic matchings in graphs of bounded maximum degree (Q2138980) (← links)
- A characterization of well-indumatchable graphs having girth greater than seven (Q2172407) (← links)
- Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier (Q2218644) (← links)
- A Ramsey-type theorem for the matching number regarding connected graphs (Q2279970) (← 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)
- Equality of distance packing numbers (Q2515579) (← links)
- Combinatorics and algorithms for augmenting graphs (Q2631076) (← links)
- Induced matchings in graphs of bounded maximum degree (Q2826215) (← links)
- Maximum Induced Matchings in Grids (Q4596162) (← links)
- The Micro-world of Cographs (Q5041177) (← links)
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
- Well-indumatched Trees and Graphs of Bounded Girth (Q5060441) (← links)
- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem (Q5131709) (← 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)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- Parameterized complexity of perfectly matched sets (Q6038698) (← links)
- Induced matchings in strongly biconvex graphs and some algebraic applications (Q6081912) (← links)
- Ramsey-type results for path covers and path partitions. II: Digraphs (Q6096342) (← links)
- Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture (Q6606329) (← links)
- Edge open packing: complexity, algorithmic aspects, and bounds (Q6646442) (← links)