"NP-Completeness of graph decomposition problems."

Edith Cohen, Michael Tarsi (1991)

> Home

Details and statistics

DOI: 10.1016/0885-064X(91)90006-J

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jc/CohenT91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jc/CohenT91
Edith Cohen, Michael Tarsi:
NP-Completeness of graph decomposition problems. J. Complex. 7(2): 200-212 (1991)

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.