On distance-3 matchings and induced matchings
From MaRDI portal
(Redirected from Publication:716178)
Recommendations
- On distance-3 matchings and induced matchings
- New min-max theorems for weakly chordal and dually chordal graphs
- On minimum maximal distance-\(k\) matchings
- On minimum maximal distance-\(k\) matchings
- 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 3889566 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3906240 (Why is no real title available?)
- scientific article; zbMATH DE number 3730183 (Why is no real title available?)
- scientific article; zbMATH DE number 3513839 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1496857 (Why is no real title available?)
- scientific article; zbMATH DE number 3893228 (Why is no real title available?)
- scientific article; zbMATH DE number 2191988 (Why is no real title available?)
- Approximability results for the maximum and minimum maximal induced matching problems
- Bipartite Domination and Simultaneous Matroid Covers
- Characterizations of strongly chordal graphs
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Decomposition by clique separators
- Finding a maximum induced matching in weakly chordal 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
- Graph Classes: A Survey
- Independent Sets in Asteroidal Triple-Free Graphs
- Independent sets of maximum weight in apple-free graphs
- Induced matchings
- Induced matchings in asteroidal triple-free graphs
- Induced matchings in bipartite graphs
- Induced matchings in cubic graphs
- Induced matchings in intersection graphs.
- Irredundancy in circular arc graphs
- Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs
- Maximum induced matchings for chordal graphs in linear time
- Modular decomposition and transitive orientation
- NP-completeness of some generalizations of the maximum matching problem
- New results on induced matchings
- On Hamiltonicity of \{claw, net\}-free graphs
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- On independent vertex sets in subclasses of apple-free graphs
- On induced matchings
- On linear and circular structure of (claw, net)-free graphs
- On maximum induced matchings in bipartite graphs
- On partition graphs
- On the approximability of the maximum induced matching problem
- On the clique-width of some perfect graph classes
- Problems and results in combinatorial analysis and graph theory
- Representation of a finite graph by a set of intervals on the real line
- Stability in circular arc graphs
- The parameterized complexity of the induced matching problem
- The structure of claw-free graphs
Cited in
(20)- Equality of distance packing numbers
- Maximum regular induced subgraphs in \(2P_3\)-free graphs
- On minimum maximal distance-\(k\) matchings
- On some hard and some tractable cases of the maximum acyclic matching problem
- Maximum matching in multi-interface networks
- Induced matchings in subcubic graphs without short cycles
- Clique‐width: Harnessing the power of atoms
- New min-max theorems for weakly chordal and dually chordal graphs
- Exploiting hidden structure in selecting dimensions that distinguish vectors
- On distance-3 matchings and induced matchings
- The maximum weight \((\{K_1,K_2\},k,l)\)-packing problem in a graph
- Approximating weighted induced matchings
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- Two greedy consequences for maximum induced matchings
- Approximating maximum uniquely restricted matchings in bipartite graphs
- scientific article; zbMATH DE number 7743715 (Why is no real title available?)
- On minimum maximal distance-\(k\) matchings
- Graphs with maximal induced matchings of the same size
- Locally searching for large induced matchings
- Maximum induced matching problem on hhd-free graphs
This page was built for publication: On distance-3 matchings and induced matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q716178)
