Pages that link to "Item:Q1779490"
From MaRDI portal
The following pages link to Generalized subgraph-restricted matchings in graphs (Q1779490):
Displaying 27 items.
- Induced matchings in subcubic graphs without short cycles (Q393187) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- Restricted matching in graphs of small genus (Q998321) (← links)
- A lower bound on the acyclic matching number of subcubic graphs (Q1637156) (← links)
- Degenerate matchings and edge colorings (Q1706114) (← links)
- Lower bounds on the uniquely restricted matching number (Q1733882) (← links)
- Approximating maximum acyclic matchings by greedy and local search strategies (Q2019502) (← links)
- Acyclic matchings in graphs of bounded maximum degree (Q2138980) (← links)
- On some hard and some tractable cases of the maximum acyclic matching problem (Q2288858) (← 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)
- Acyclic matching in some subclasses of graphs (Q2680984) (← links)
- On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph (Q3655146) (← links)
- ACYCLIC MATCHINGS IN SUBCLASSES OF BIPARTITE GRAPHS (Q4903635) (← links)
- Acyclic Matching in Some Subclasses of Graphs (Q5041209) (← links)
- On the complexity of minimum maximal uniquely restricted matching (Q5918362) (← links)
- Disconnected matchings (Q5925688) (← links)
- Disconnected matchings (Q5972267) (← links)
- On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)
- Revisiting semistrong edge‐coloring of graphs (Q6199384) (← links)
- Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius (Q6614030) (← links)
- On the complexity of minimum maximal acyclic matchings (Q6621851) (← links)
- Polyhedral approach to weighted connected matchings in general graphs (Q6633527) (← links)
- Minimum maximal acyclic matching in proper interval graphs (Q6648282) (← links)
- Parameterized results on acyclic matchings with implications for related problems (Q6655671) (← links)