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.
Timeline
Mendeley readers
Chapter title |
Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract)
|
---|---|
Chapter number | 4 |
Book title |
Combinatorial Algorithms
|
Published by |
Springer, Cham, July 2018
|
DOI | 10.1007/978-3-319-94667-2_4 |
Book ISBNs |
978-3-31-994666-5, 978-3-31-994667-2
|
Authors |
Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi, Baiocchi, Pierluigi, Calamoneri, Tiziana, Monti, Angelo, Petreschi, Rossella |
Mendeley readers
The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 2 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor > Associate Professor | 1 | 50% |
Unknown | 1 | 50% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 1 | 50% |
Unknown | 1 | 50% |