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 |
Degree Bounds for Long Paths and Cycles in k-Connected Graphs
|
|---|---|
| Chapter number | 5 |
| Book title |
Computational Discrete Mathematics
|
| Published by |
Springer, Berlin, Heidelberg, January 2001
|
| DOI | 10.1007/3-540-45506-x_5 |
| Book ISBNs |
978-3-54-042775-9, 978-3-54-045506-6
|
| Authors |
Heinz Adolf Jung |
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% |
| Lecturer | 1 | 50% |
| Readers by discipline | Count | As % |
|---|---|---|
| Mathematics | 1 | 50% |
| Agricultural and Biological Sciences | 1 | 50% |