Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A Survey on the Computational Complexity of Coloring Graphs with Forbidden ..."

Petr A. Golovach et al. (2017)

> Home

Details and statistics

DOI: 10.1002/JGT.22028

access: closed

type: Journal Article

metadata version: 2021-02-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgt/GolovachJPS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/GolovachJPS17
Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song:
A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs. J. Graph Theory 84(4): 331-363 (2017)

a service of

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.