9780471389255 - Graph Theory (Wiley-Interscience Series in Discrete Mathematics and Optimization) von Merris, Russell (10 Ergebnisse)

Hardcover. Zustand: Very Good. 1. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Zustand: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc.

Hardcover. Zustand: Fair. No Jacket. Former library book; Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less.

Zustand: New. xiv, 237 pp., Hardcover, NEW!! - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Photos available upon request.

Zustand: New. In.

Zustand: New. pp. xi + 237 Illus.

Gebunden. Zustand: New. Reviewed jointly with A Beginner s Guide to Graph Theory by W.D. Wallis published by Birkhauser: .both.are.quite similar. Merris writes in a lively tone.all.have adequate sets of exercises. Those in Graph Theory are somewhat more generous, an.

Hardcover. Zustand: Brand New. 1st edition. 237 pages. 9.50x6.25x0.75 inches. In Stock.

Zustand: New. A remarkably accessible introduction to graph theory, assuming only undergraduate level linear algebra. Readers will get an excellent overview of the general principles while gaining an appreciation for the elegance and power of the subject matter. Series: Wiley Series in Discrete Mathematics and Optimization. Num Pages: 256 pages, bibliography, indexes. BIC Classification: PBV. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 236 x 163 x 21. Weight in Grams: 534. . 2000. 1st Edition. Hardcover. . . . . Books ship from the US and Ireland.

Buch. Zustand: Neu. Neuware - A lively invitation to the flavor, elegance, and power of graph theoryThis mathematically rigorous introduction is tempered and enlivened by numerous illustrations, revealing examples, seductive applications, and historical references. An award-winning teacher, Russ Merris has crafted a book designed to attract and engage through its spirited exposition, a rich assortment of well-chosen exercises, and a selection of topics that emphasizes the kinds of things that can be manipulated, counted, and pictured. Intended neither to be a comprehensive overview nor an encyclopedic reference, this focused treatment goes deeply enough into a sufficiently wide variety of topics to illustrate the flavor, elegance, and power of graph theory.Another unique feature of the book is its user-friendly modular format. Following a basic foundation in Chapters 1-3, the remainder of the book is organized into four strands that can be explored independently of each other. These strands center, respectively, around matching theory; planar graphs and hamiltonian cycles; topics involving chordal graphs and oriented graphs that naturally emerge from recent developments in the theory of graphic sequences; and an edge coloring strand that embraces both Ramsey theory and a self-contained introduction to Pólya's enumeration of nonisomorphic graphs. In the edge coloring strand, the reader is presumed to be familiar with the disjoint cycle factorization of a permutation. Otherwise, all prerequisites for the book can be found in a standard sophomore course in linear algebra.The independence of strands also makes Graph Theory an excellent resource for mathematicians who require access to specific topics without wanting to read an entire book on the subject.; Eine verständliche Einführung in die Graphentheorie! Allgemeine Prinzipien werden so erläutert, daß der Leser ein Gespür für die Eleganz und Leistungsfähigkeit der Verfahren entwickelt. Präzise Erklärungen werden durch Beispiele und Abbildungen untermauert. Zahlreiche Anwendungen werden vorgestellt; der Interessierte findet auch viele Verweise auf historische Zusammenhänge. (12/00).