Pages that link to "Item:Q557830"
From MaRDI portal
The following pages link to On approximating minimum vertex cover for graphs with perfect matching (Q557830):
Displaying 7 items.
- The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- Equivalence between the minimum covering problem and the maximum matching problem (Q1068107) (← links)
- A note on minimal matching covered graphs (Q2368933) (← links)
- Maintaining a large matching and a small vertex cover (Q2875173) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number (Q5387763) (← links)
