On the complexity of minimum maximal uniquely restricted matching
From MaRDI portal
Recommendations
- On the complexity of minimum maximal uniquely restricted matching
- On the complexity of minimum cardinality maximal uniquely restricted matching in graphs
- Approximating maximum uniquely restricted matchings in bipartite graphs
- On the maximum uniquely restricted matching for bipartite graphs
- Hardness and approximation of minimum maximal matchings
- On the complexity of minimum maximal acyclic matchings
- Random restricted matching and lower bounds for combinatorial optimization
- Tight bounds on maximal and maximum matchings
- scientific article; zbMATH DE number 2081000
- On unicyclic graphs with uniquely restricted maximum matchings
Cites work
- A linear time recognition algorithm for proper interval graphs
- A review of tree convex sets test
- Acyclic Matching in Some Subclasses of Graphs
- Alternating cycle-free matchings
- Bipartite permutation graphs with application to the minimum buffer size problem
- Domination in some subclasses of bipartite graphs
- Generalized subgraph-restricted matchings in graphs
- scientific article; zbMATH DE number 4152428 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- Independent domination in chordal graphs
- Independent domination in graphs: A survey and recent results
- Linear-time certifying recognition algorithms and forbidden induced subgraphs
- On the complexity of minimum cardinality maximal uniquely restricted matching in graphs
- On the complexity of minimum maximal uniquely restricted matching
- On the maximum uniquely restricted matching for bipartite graphs
- Optimization, approximation, and complexity classes
- Uniquely restricted matchings
- Uniquely restricted matchings and edge colorings
- Uniquely restricted matchings in interval graphs
Cited in
(11)- On the complexity of minimum cardinality maximal uniquely restricted matching in graphs
- On the hardness of deciding the equality of the induced and the uniquely restricted matching number
- On the maximum uniquely restricted matching for bipartite graphs
- Hardness and approximation of minimum maximal matchings
- On the complexity of minimum maximal uniquely restricted matching
- Minimum maximal acyclic matching in proper interval graphs
- On the complexity of minimum maximal acyclic matchings
- Uniquely restricted matching extendable graphs
- On the complexity of minimum maximal acyclic matchings
- Minimum maximal acyclic matching in proper interval graphs
- Parameterized results on acyclic matchings with implications for related problems
This page was built for publication: On the complexity of minimum maximal uniquely restricted matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918362)
