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 |
Generating all planar 0-,1-,2-,3-connected graphs
|
|---|---|
| Chapter number | 28 |
| Book title |
Graphtheoretic Concepts in Computer Science
|
| Published by |
Springer, Berlin, Heidelberg, June 1980
|
| DOI | 10.1007/3-540-10291-4_28 |
| Book ISBNs |
978-3-54-010291-5, 978-3-54-038435-9
|
| Authors |
Peter Läuchli |
Mendeley readers
The data shown below were compiled from readership statistics for 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Unknown | 6 | 100% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Lecturer | 1 | 17% |
| Student > Bachelor | 1 | 17% |
| Professor | 1 | 17% |
| Student > Ph. D. Student | 1 | 17% |
| Student > Master | 1 | 17% |
| Other | 1 | 17% |
| Readers by discipline | Count | As % |
|---|---|---|
| Mathematics | 2 | 33% |
| Computer Science | 2 | 33% |
| Biochemistry, Genetics and Molecular Biology | 1 | 17% |
| Agricultural and Biological Sciences | 1 | 17% |