"On the NP-completeness of the perfect matching free subgraph problem."

Mathieu Lacroix et al. (2012)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2011.12.065

access: open

type: Journal Article

metadata version: 2025-02-04

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/LacroixMMP12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/LacroixMMP12
Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin, Christophe Picouleau:
On the NP-completeness of the perfect matching free subgraph problem. Theor. Comput. Sci. 423: 25-29 (2012)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.