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 |
b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs
|
---|---|
Chapter number | 9 |
Book title |
Combinatorial Optimization
|
Published by |
Springer International Publishing, January 2014
|
DOI | 10.1007/978-3-319-09174-7_9 |
Book ISBNs |
978-3-31-909173-0, 978-3-31-909174-7
|
Authors |
Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon |
Editors |
Pierre Fouilhoux, Luis Eduardo Neves Gouveia, A. Ridha Mahjoub, Vangelis T. Paschos |
Mendeley readers
The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 1 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 1 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 1 | 100% |