The following pages link to Uniquely restricted matchings (Q5946402):
Displaying 45 items.
- Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs (Q328720) (← links)
- Local maximum stable set greedoids stemming from very well-covered graphs (Q444454) (← links)
- Zero forcing number, constrained matchings and strong structural controllability (Q491112) (← links)
- On graphs with a unique perfect matching (Q497377) (← links)
- Crowns in bipartite graphs (Q510531) (← links)
- On local maximum stable set greedoids (Q658102) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings (Q1414591) (← links)
- From G-parking functions to B-parking functions (Q1671775) (← links)
- On the complexity of minimum cardinality maximal uniquely restricted matching in graphs (Q1683558) (← links)
- Uniquely restricted matchings and edge colorings (Q1687907) (← links)
- Degenerate matchings and edge colorings (Q1706114) (← links)
- Lower bounds on the uniquely restricted matching number (Q1733882) (← links)
- Generalized subgraph-restricted matchings in graphs (Q1779490) (← links)
- On some graphs with a unique perfect matching (Q1799576) (← links)
- Strong structural input and state observability of linear time-invariant systems: graphical conditions and algorithms (Q1996663) (← links)
- Critical sets, crowns and local maximum independent sets (Q2149605) (← links)
- On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs (Q2283036) (← links)
- On some hard and some tractable cases of the maximum acyclic matching problem (Q2288858) (← links)
- Approximating maximum uniquely restricted matchings in bipartite graphs (Q2322866) (← links)
- On the hardness of deciding the equality of the induced and the uniquely restricted matching number (Q2414056) (← links)
- Uniquely restricted matchings in subcubic graphs (Q2416436) (← links)
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids (Q2462380) (← links)
- On unicyclic graphs with uniquely restricted maximum matchings (Q2637732) (← links)
- Security index based on perfectly undetectable attacks: graph-theoretic conditions (Q2665727) (← links)
- Unique maximum matching algorithms (Q2746432) (← links)
- Unique maximum matching algorithms (Q2819535) (← links)
- Parameterized complexity of discrete Morse theory (Q2828168) (← links)
- On the maximum uniquely restricted matching for bipartite graphs (Q2840733) (← links)
- VERY WELL-COVERED GRAPHS OF GIRTH AT LEAST FOUR AND LOCAL MAXIMUM STABLE SET GREEDOIDS (Q3087098) (← links)
- Uniquely Restricted Matchings in Interval Graphs (Q3130447) (← links)
- Unicycle graphs and uniquely restricted maximum matchings (Q3439344) (← links)
- On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph (Q3655146) (← links)
- The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions (Q4592948) (← links)
- (Q4993356) (← links)
- On the complexity of minimum maximal uniquely restricted matching (Q5918362) (← links)
- Disconnected matchings (Q5925688) (← links)
- Disconnected matchings (Q5972267) (← links)
- Uniquely restricted matchings in subcubic graphs without short cycles (Q6055410) (← links)
- Unique stable matchings (Q6176757) (← links)
- Uniquely restricted matching extendable graphs (Q6544522) (← links)
- Gated independence in graphs (Q6546421) (← links)
- On the complexity of minimum maximal acyclic matchings (Q6621851) (← links)
- Polyhedral approach to weighted connected matchings in general graphs (Q6633527) (← links)
- Parameterized results on acyclic matchings with implications for related problems (Q6655671) (← links)
