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 |
Connected Coloring Completion for General Graphs: Algorithms and Complexity
|
---|---|
Chapter number | 10 |
Book title |
Computing and Combinatorics
|
Published by |
Springer, Berlin, Heidelberg, January 2007
|
DOI | 10.1007/978-3-540-73545-8_10 |
Book ISBNs |
978-3-54-073544-1, 978-3-54-073545-8
|
Authors |
Chor, Benny, Fellows, Michael, Ragan, Mark A., Razgon, Igor, Rosamond, Frances, Snir, Sagi, Benny Chor, Michael Fellows, Mark A. Ragan, Igor Razgon, Frances Rosamond, Sagi Snir |
Mendeley readers
The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 4 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 1 | 25% |
Professor > Associate Professor | 1 | 25% |
Researcher | 1 | 25% |
Lecturer | 1 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 1 | 25% |
Computer Science | 1 | 25% |
Agricultural and Biological Sciences | 1 | 25% |
Engineering | 1 | 25% |