Book contents
- Frontmatter
- Contents
- Preface
- Combinatorics and Ramanujan's “Lost” Notebook
- Irregularities of distribution and combinatorics
- Adaptive algorithms for communications
- Random flows: network flows and electrical flows through random media
- On greedy algorithms that succeed
- {0, 1*} distance problems in combinatorics
- Detachments of graphs and generalised Euler trails
- Graph minors – a survey
- Index
Detachments of graphs and generalised Euler trails
Published online by Cambridge University Press: 05 May 2013
- Frontmatter
- Contents
- Preface
- Combinatorics and Ramanujan's “Lost” Notebook
- Irregularities of distribution and combinatorics
- Adaptive algorithms for communications
- Random flows: network flows and electrical flows through random media
- On greedy algorithms that succeed
- {0, 1*} distance problems in combinatorics
- Detachments of graphs and generalised Euler trails
- Graph minors – a survey
- Index
Summary
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9781107325678/resource/name/firstPage-9781107325678c7_p137-152_CBO.jpg)
- Type
- Chapter
- Information
- Surveys in Combinatorics 1985Invited Papers for the Tenth British Combinatorial Conference, pp. 137 - 152Publisher: Cambridge University PressPrint publication year: 1985
- 5
- Cited by