product iamge

Eulerian Graphs and Related Topics

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Herbert Fleischner (Eds.)
Series: Annals of Discrete Mathematics 50
Publisher: Elsevier, Academic Press
Year: 1991

Language: English
Pages: ii-vii, VIII

Content:
Advisory Editors
Page ii

Edited by
Page iii

Copyright page
Page iv

Dedication
Page v

Preface
Page vii

Chapter VIII Various Types of Closed Covering Walks
Pages VIII.1-VIII.144

Chapter IX Eulerian Trails — How Many?
Pages IX.1-IX.110

Chapter X Algorithms for Eulerian Trails and Cycle Decompositions, Maze Search Algorithms
Pages X.1-X.34

Bibliography
Pages A.1-A.25

Index
Pages B.1-B.7

Appendix: Corrections and Addenda to Volume 1
Pages C.1-C.3