Isbn: 9780521593458 - bipartite graphs and their applications. (cambridge tracts in mathematics, vol.131) (9 Ergebnisse)

Hardcover. First Edition. Octavo, x, 259 pages. In Very Good minus condition with Good plus Dust jacket with mylar covering. Dust jacket has some shelf wear, some closed tears and creasing along the head edge, and minor rubbing. Boards have minor bumping to corners and minor shelf wear. NOTE: Shelved in Netdesk Column R (ND-R). 1377099. FP New Rockville Stock. …

Hardcover. Zustand: Gut. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 65 ASR 9780521593458 Sprache: Englisch Gewicht in Gramm: 550.…

Hardcover. Zustand: Gut. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 65 ASR 9780521593458 Sprache: Englisch Gewicht in Gramm: 550.…

Zustand: New. In English.

Zustand: Gut. Zustand: Gut | Seiten: 272 | Sprache: Englisch | Produktart: Bücher | Bipartite graphs are perhaps the most basic of objects in graph theory, both from a theoretical and practical point of view. Until now, they have been considered only as a special class in some wider context. This work deals solely with bipartite graphs, providing traditional material as well as many new and unusual results. The authors illustrate the theory with many applications, especially to problems in timetabling, chemistry, communication networks and computer science. The material is accessible to any reader with a graduate understanding of mathematics and will be of interest to specialists in combinatorics and graph theory.…

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 272 | Sprache: Englisch | Produktart: Bücher | Bipartite graphs are perhaps the most basic of objects in graph theory, both from a theoretical and practical point of view. Until now, they have been considered only as a special class in some wider context. This work deals solely with bipartite graphs, providing traditional material as well as many new and unusual results. The authors illustrate the theory with many applications, especially to problems in timetabling, chemistry, communication networks and computer science. The material is accessible to any reader with a graduate understanding of mathematics and will be of interest to specialists in combinatorics and graph theory.…

Zustand: New. This book treats the fundamental mathematical properties that hold for a family of Gaussian random variables. Series Editor(s): Bollobas, B.; Fulton, W.; Katok, A.; Kirwan, F.; Sarnak, P.; Simon, B. Series: Cambridge Tracts in Mathematics. Num Pages: 272 pages, many line drawings. BIC Classification: PBV. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 19. Weight in Grams: 570. . 1998. hardcover. . . . . Books ship from the US and Ireland.…

Hardcover. Zustand: Brand New. 259 pages. 9.50x6.25x0.75 inches. In Stock.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Bipartite graphs are perhaps the most basic of objects in graph theory, both from a theoretical and practical point of view. However, sometimes they have been considered only as a special class in some wider context. This book deals solely with bipartite graphs. Together with traditional material, the reader will also find many unusual results. Essentially all proofs are given in full; many of these have been streamlined specifically for this text. Numerous exercises of all standards have also been included. The theory is illustrated with many applications especially to problems in timetabling, chemistry, communication networks and computer science. For the most part the material is accessible to any reader with a graduate understanding of mathematics. However, the book contains advanced sections requiring much more specialized knowledge, which will be of interest to specialists in combinatorics and graph theory.…