Combining the features of a textbook with those of a problem workbook, this text for mathematics, computer science and engineering students presents a natural, friendly way to learn some of the essential ideas of graph theory. The material is explained using 360 strategically placed problems with connecting text, which is then supplemented by 280 additional homework problems. This problem-oriented format encourages active involvement by the reader while always giving clear direction. This approach is especially valuable with the presentation of proofs, which become more frequent and elaborate as the book progresses. Arguments are arranged in digestible chunks and always appear together with concrete examples to help remind the reader of the bigger picture. Topics include spanning tree algorithms, Euler paths, Hamilton paths and cycles, independence and covering, connections and obstructions, and vertex and edge colourings.
Reihe
Sprache
Verlagsort
Zielgruppe
Für höhere Schule und Studium
Illustrationen
Worked examples or Exercises
Maße
Höhe: 260 mm
Breite: 182 mm
Dicke: 16 mm
Gewicht
ISBN-13
978-0-88385-753-3 (9780883857533)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
Daniel A. Marcus was Professor of Mathematics at California State Polytechnic University, Pomona.
Preface; A. Basic Concepts; B. Isomorphic graphs; C. Bipartite graphs; D. Trees and forests; E. Spanning tree algorithms; F. Euler paths; G. Hamilton paths and cycles; H. Planar graphs; I. Independence and covering; J. Connections and obstructions; K. Vertex coloring; L. Edge coloring; M. Matching theory for bipartite graphs; N. Applications of matching theory; O. Cycle-Free digraphs; Answers to selected problems.
