You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Mendeley readers
Chapter title |
Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs
|
---|---|
Chapter number | 8 |
Book title |
Graph Theoretic Concepts in Computer Science
|
Published by |
Springer, Berlin, Heidelberg, June 2010
|
DOI | 10.1007/978-3-642-16926-7_8 |
Book ISBNs |
978-3-64-216925-0, 978-3-64-216926-7
|
Authors |
Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song, Broersma, Hajo, Golovach, Petr A., Paulusma, Daniël, Song, Jian |
Mendeley readers
The data shown below were compiled from readership statistics for 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 6 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor > Associate Professor | 3 | 50% |
Researcher | 1 | 17% |
Lecturer | 1 | 17% |
Unknown | 1 | 17% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 2 | 33% |
Computer Science | 2 | 33% |
Agricultural and Biological Sciences | 1 | 17% |
Unknown | 1 | 17% |