"Recognizing Tenacious Graphs Is NP-Hard."

Seyed Morteza Dadvand, Dara Moazzami, Ali Moeini (2014)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2014-09-05

- no documents available
- export record
  dblp key:
  - journals/arscom/DadvandMM14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arscom/DadvandMM14
Seyed Morteza Dadvand, Dara Moazzami, Ali Moeini:
Recognizing Tenacious Graphs Is NP-Hard. Ars Comb. 115: 163-174 (2014)

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.