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 |
Proof of Toft’s Conjecture: Every Graph Containing No Fully Odd K 4 Is 3-Colorable
|
---|---|
Chapter number | 30 |
Book title |
Computing and Combinatorics
|
Published by |
Springer, Berlin, Heidelberg, August 1998
|
DOI | 10.1007/3-540-68535-9_30 |
Book ISBNs |
978-3-54-064824-6, 978-3-54-068535-7
|
Authors |
Wenan Zang, Zang, Wenan |
Mendeley readers
The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 3 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor > Associate Professor | 2 | 67% |
Lecturer | 1 | 33% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 1 | 33% |
Computer Science | 1 | 33% |
Agricultural and Biological Sciences | 1 | 33% |