Recommendations
- Induced matchings
- Induced matchings in intersection graphs.
- Induced Matching in Some Subclasses of Bipartite Graphs
- scientific article; zbMATH DE number 1496857
- Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
Cites work
- scientific article; zbMATH DE number 434499 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 1303554 (Why is no real title available?)
- A Characterization of Comparability Graphs and of Interval Graphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
- Comparability graphs and a new matroid
- Efficient algorithms for interval graphs and circular-arc graphs
- Induced matchings
- Irredundancy in circular arc graphs
- Linear time algorithms on circular-arc graphs
- Minimum Cuts for Circular-Arc Graphs
- Stability in circular arc graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Trapezoid graphs and generalizations, geometry and algorithms
- Trapezoid graphs and their coloring
Cited in
(83)- Maximum matching in multi-interface networks
- Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs
- The graphs with maximum induced matching and maximum matching the same size
- Matchings, coverings, and Castelnuovo-Mumford regularity
- On the strong chromatic index of cubic Halin graphs
- Algorithms for finding an independent \(\{K_1,K_2\}\)-packing of maximum weight in a graph
- Strong edge-coloring for cubic Halin graphs
- Induced Matching in Some Subclasses of Bipartite Graphs
- Maximum regular induced subgraphs in 2P₃-free graphs
- An improved exact algorithm for maximum induced matching
- Independent packings in structured graphs
- Some results on dominating induced matchings
- A bisection approach to subcubic maximum induced matching
- Approximating weighted induced matchings
- Almost induced matching: linear kernels and parameterized algorithms
- Maximum induced matchings of random cubic graphs
- Generalized subgraph-restricted matchings in graphs
- The induced separation dimension of a graph
- Maximum induced matching of hexagonal graphs
- Parameterized algorithms and kernels for almost induced matching
- On the Induced Matching Problem
- Maximum induced matching problem on hhd-free graphs
- Induced matchings in graphs of degree at most 4
- On the computational complexity of strong edge coloring
- Some results on graphs without long induced paths
- Exact algorithms for maximum induced matching
- Induced matchings
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
- A min-max property of chordal bipartite graphs with applications
- Maximum weight induced matching in some subclasses of bipartite graphs
- On the parameterized complexity of the acyclic matching problem
- The strong chromatic index of Halin graphs
- A linear algorithm for computing of a minimum weight maximal induced matching in an edge-weighted tree
- Proof of a conjecture on the strong chromatic index of Halin graphs
- Induced packing of odd cycles in planar graphs
- Generalizing the induced matching by edge capacity constraints
- Graphs with maximal induced matchings of the same size
- Maximum Induced Matchings in Grids
- On the complexity of the dominating induced matching problem in hereditary classes of graphs
- On maximum induced matchings in bipartite graphs
- Induced matchings in intersection graphs
- Induced matchings in asteroidal triple-free graphs
- A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem
- Brambles and independent packings in chordal graphs
- Efficient edge domination in regular graphs
- The parameterized complexity of the induced matching problem
- Computational complexity aspects of super domination
- Induced matchings in strongly biconvex graphs and some algebraic applications
- Moderately exponential time algorithms for the maximum induced matching problem
- Strong edge chromatic index of the generalized Petersen graphs
- On distance-3 matchings and induced matchings
- An improved kernel and parameterized algorithm for almost induced matching
- New kernels for several problems on planar graphs
- Maximum induced matching algorithms via vertex ordering characterizations
- Squares of Intersection Graphs and Induced Matchings
- Neighborhood covering and independence on P₄-tidy graphs and tree-cographs
- On distance-3 matchings and induced matchings
- Maximum induced matching algorithms via vertex ordering characterizations
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs
- Equality of distance packing numbers
- Dominating induced matchings
- A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree
- Well-indumatched pseudoforests
- Approximability results for the maximum and minimum maximal induced matching problems
- Upper bounds for the strong chromatic index of Halin graphs
- The induced matching and chain subgraph cover problems for convex bipartite graphs
- Maximum induced matchings for chordal graphs in linear time
- Strong edge-coloring for jellyfish graphs
- Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
- Large Induced Subgraphs via Triangulations and CMSO
- Recent progress on strong edge-coloring of graphs
- Tree-Width and Optimization in Bounded Degree Graphs
- A constant factor approximation algorithm for boxicity of circular arc graphs
- New results relating independence and matchings
- Number of induced matchings of graphs
- On the approximability of the maximum induced matching problem
- Induced matchings in intersection graphs.
- Perfectly matched sets in graphs: parameterized and exact computation
- A characterization of well-indumatchable graphs having girth greater than seven
- Well-indumatched Trees and Graphs of Bounded Girth
- Finding a maximum induced matching in weakly chordal graphs
- Efficient maximum matching algorithms for trapezoid graphs
- Maximum induced matchings close to maximum matchings
This page was built for publication: New results on induced matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1975379)
