"NP-Completeness and One Polynomial Subclass of the Two-Step Graph ..."

Natalya Sergeevna Medvedeva, Alexander Valeryevich Smirnov (2020)

> Home

Details and statistics

DOI: 10.3103/S0146411620070159

access: closed

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/accs/MedvedevaS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/accs/MedvedevaS20
Natalya Sergeevna Medvedeva, Alexander Valeryevich Smirnov:
NP-Completeness and One Polynomial Subclass of the Two-Step Graph Colouring Problem. Autom. Control. Comput. Sci. 54(7): 685-696 (2020)

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.