Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Front Cover; Eulerian Graphs and Related Topics; CONTENTS; PREFACE; Chapter VIII. VARIOUS TYPES OF CLOSED COVERING WALKS; VIII.1. Double Tracings; VIII.2. Value-True Walks and Integer Flows in Graphs; VIII.3. The Chinese Postman Problem; VIII.4. Exercises; Chapter IX. EULERIAN TRAILS - HOW MANY ?; IX.1. . . . As Many As . . . - Parity Results for Digraphs and (Mixed) Graphs; IX.2. The Number is . . . - A First Excursion Into Enumeration; IX.3. Exercises; Chapter X . ALGORITHMS FOR EULERIAN TRAILS AND CYCLE DECOMPOSITIONS, MAZE SEARCH ALGORITHMS; X.l. Algorithms for Eulerian Trails
X.2. Algorithms for Cycle DecompositionsX.3. Mazes; X.4. Exercises; Bibliography; Index; Appendix: Corrections and Addenda to Volume 1