"Remarks on the complexity of signed k-independece on graphs."

Chuan-Min Lee (2015)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2015-09-21

- no documents available
- export record
  dblp key:
  - journals/arscom/Lee15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arscom/Lee15
Chuan-Min Lee:
Remarks on the complexity of signed k-independece on graphs. Ars Comb. 123: 303-315 (2015)

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.