Pages that link to "Item:Q418003"
From MaRDI portal
The following pages link to On the NP-completeness of the perfect matching free subgraph problem (Q418003):
Displaying 7 items.
- On the NP-completeness of the perfect matching free subgraph problem (Q418003) (← links)
- Strong matching preclusion number of graphs (Q1694672) (← links)
- Matching preclusion number of graphs (Q1711840) (← links)
- Fractional matching preclusion number of graphs and the perfect matching polytope (Q2307510) (← links)
- How to Secure Matchings Against Edge Failures (Q5090488) (← links)
- How to Secure Matchings against Edge Failures (Q5157391) (← links)
- On anti-Kekulé and \(s\)-restricted matching preclusion problems (Q6039537) (← links)
