Induced Matching in Some Subclasses of Bipartite Graphs
From MaRDI portal
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)
Recommendations
- Induced matchings in bipartite graphs
- Dominating induced matching in some subclasses of bipartite graphs
- Dominating induced matching in some subclasses of bipartite graphs
- On maximum induced matchings in bipartite graphs
- Induced matchings in subcubic graphs
- Induced matchings in graphs of bounded maximum degree
- On the induced matching problem in Hamiltonian bipartite graphs
- Induced matchings in intersection graphs
- Induced matchings in subcubic planar graphs
- Induced matchings in subcubic planar graphs
Cites work
- Circular convex bipartite graphs: feedback vertex sets
- Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
- Domination in some subclasses of bipartite graphs
- Feedback vertex sets on restricted bipartite graphs
- 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
- scientific article; zbMATH DE number 1420901 (Why is no real title available?)
- Independent domination on tree convex bipartite graphs
- Induced matchings
- New results on induced matchings
- NP-completeness of some generalizations of the maximum matching problem
- On maximum induced matchings in bipartite graphs
- On the approximability of the maximum induced matching problem
- Perfect Elimination and Chordal Bipartite Graphs
- Restricted Bipartite Graphs: Comparison and Hardness Results
- The induced matching and chain subgraph cover problems for convex bipartite graphs
- Tractable connected domination for restricted bipartite graphs (extended abstract)
Cited in
(21)- Induced matchings
- Induced matchings in intersection graphs.
- Finding a maximum induced matching in weakly chordal graphs
- On maximum induced matchings in bipartite graphs
- An inductive characterization of matching in binding bigraphs
- New results on maximum induced matchings in bipartite graphs and beyond
- New results on induced matchings
- Maximum weight induced matching in some subclasses of bipartite graphs
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs
- Acyclic matching in some subclasses of graphs
- The conditions of a matching being induced
- On graphs with induced matching number almost equal to matching number
- Induced matchings in subcubic graphs without short cycles
- scientific article; zbMATH DE number 2192124 (Why is no real title available?)
- Dominating induced matching in some subclasses of bipartite graphs
- Dominating induced matching in some subclasses of bipartite graphs
- Induced matchings in strongly biconvex graphs and some algebraic applications
- Complexity of deciding the equality of matching numbers
- Maximum induced matching of hexagonal graphs
- Induced matchings in bipartite graphs
- The induced matching and chain subgraph cover problems for convex bipartite graphs
This page was built for publication: Induced Matching in Some Subclasses of Bipartite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2971661)
