"On the (parameterized) complexity of recognizing well-covered (r, l)-graphs."

Sancrey Rodrigues Alves et al. (2017)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2022-01-03

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/AlvesDFKSS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/AlvesDFKSS17
Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza:
On the (parameterized) complexity of recognizing well-covered (r, l)-graphs. CoRR abs/1705.09177 (2017)

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.