Finding maximum induced matchings in subclasses of claw-free and P₅-free graphs, and in graphs with matching and induced matching of equal maximum size
From MaRDI portal
(Redirected from Publication:1762983)
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
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
Recommendations
Cited in
(67)- Maximum matching in multi-interface networks
- The graphs with maximum induced matching and maximum matching the same size
- Algorithms for finding an independent \(\{K_1,K_2\}\)-packing of maximum weight in a graph
- Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs of bounded treewidth
- Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs with special blocks
- Induced Matching in Some Subclasses of Bipartite Graphs
- Maximum regular induced subgraphs in 2P₃-free graphs
- Independent packings in structured graphs
- A bisection approach to subcubic maximum induced matching
- Approximating weighted induced matchings
- Boundary Classes of Planar Graphs
- Almost induced matching: linear kernels and parameterized algorithms
- The complexity of dissociation set problems in graphs
- Approximating maximum acyclic matchings by greedy and local search strategies
- On the computational complexity of the Helly number in the \(P_3\) and related convexities
- Maximum induced matching of hexagonal graphs
- Parameterized algorithms and kernels for almost induced matching
- Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity
- Induced matchings in graphs of degree at most 4
- On some hard and some tractable cases of the maximum acyclic matching problem
- Exact algorithms for maximum induced matching
- Sparse regular induced subgraphs in \(2P_3\)-free graphs
- Acyclic matchings in graphs of bounded maximum degree
- Maximum weight induced matching in some subclasses of bipartite graphs
- On the parameterized complexity of the acyclic matching problem
- A linear algorithm for computing of a minimum weight maximal induced matching in an edge-weighted tree
- Weighted connected matchings
- On the hardness of deciding the equality of the induced and the uniquely restricted matching number
- Generalizing the induced matching by edge capacity constraints
- On graphs with induced matching number almost equal to matching number
- 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
- NP-hard graph problems and boundary classes of graphs
- Brambles and independent packings in chordal graphs
- Efficient edge domination in regular graphs
- Disconnected matchings
- Disconnected matchings
- The parameterized complexity of the induced matching problem
- Computational complexity aspects of super domination
- Maximal induced matchings in \(K_4\)-free and \(K_5\)-free graphs
- Moderately exponential time algorithms for the maximum induced matching problem
- On distance-3 matchings and induced matchings
- An improved kernel and parameterized algorithm for almost induced matching
- Parameterized complexity of induced graph matching on claw-free graphs
- New kernels for several problems on planar graphs
- Edge open packing: complexity, algorithmic aspects, and bounds
- Maximum induced matching algorithms via vertex ordering characterizations
- Squares of Intersection Graphs and Induced Matchings
- 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
- Well-indumatched pseudoforests
- Approximability results for the maximum and minimum maximal induced matching problems
- Maximum induced matchings for chordal graphs in linear time
- Recent progress on strong edge-coloring of graphs
- Tree-Width and Optimization in Bounded Degree Graphs
- Locally searching for large induced matchings
- On the approximability of the maximum induced matching problem
- Perfectly matched sets in graphs: parameterized and exact computation
- Prime graphs, matchings and the Castelnuovo-Mumford regularity
- On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs
- Well-indumatched Trees and Graphs of Bounded Girth
- Finding a maximum induced matching in weakly chordal graphs
- Maximum induced matchings close to maximum matchings
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762983)
