Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"On the parameterized complexity of coloring graphs in the absence of a ..."

Jean-François Couturier et al. (2012)

> Home

Details and statistics

DOI: 10.1016/J.JDA.2012.04.008

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jda/CouturierGKP12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/CouturierGKP12
Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
On the parameterized complexity of coloring graphs in the absence of a linear forest. J. Discrete Algorithms 15: 56-62 (2012)

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.