Trenk Ann (16 results)

Condition: Very Good. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condition: Very Good. 278 pp., hardcover, previous owner's name to front free endpaper, light wear to cover edges, else text and binding clean and tight. - 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.…

Hardcover. Condition: Like New. First Edition. A firm and square hardback with sharp corners and strong joints, just showing a few very minor rubs. Hence a non-text page has a small 'damaged' stamp. Despite such this book is actually in nearly new condition. Thus the contents are crisp, fresh and tight. Now offered for sale at a very sensible price.…

Condition: New.

Condition: New. A rigorous treatment of tolerance graphs for researchers and graduate students which collects important results and discusses applications. Series Editor(s): Bollobas, B.; Fulton, W.; Katok, A.; Kirwan, F.; Sarnak, P.; Simon, B.; Totaro, B. Series: Cambridge Studies in Advanced Mathematics. Num Pages: 278 pages, 75 b/w illus. BIC Classification: PBV; PBW. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 17. Weight in Grams: 578. . 2004. Hardback. . . . .…

Condition: New. In English.

Hardback. Condition: New. The study of algorithmic graph theory and structured families of graphs is an important branch of discrete mathematics. It finds numerous applications, from data transmission through networks to efficiently scheduling aircraft and crews, as well as contributing to breakthroughs in genetic analysis and studies of the brain. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. One of these is the study of tolerance graphs and tolerance orders. This book contains the first thorough study of tolerance graphs and related topics, indeed the authors have included proofs of major results previously unpublished in book form. It will act as a springboard for researchers, and especially graduate students, to pursue new directions of investigation. With many examples and exercises it is also suitable for use as the text for a graduate course in graph theory.…

Hardcover. Condition: Brand New. 1st edition. 278 pages. 9.00x6.25x0.75 inches. In Stock.

Gebunden. Condition: New. The first rigorous treatment of tolerance graphs in book form. This book will act as a springboard for researchers, especially graduate students, to pursue new directions of investigation. With many examples and exercises it is also suitable for use as the .

Condition: New. A rigorous treatment of tolerance graphs for researchers and graduate students which collects important results and discusses applications. Series Editor(s): Bollobas, B.; Fulton, W.; Katok, A.; Kirwan, F.; Sarnak, P.; Simon, B.; Totaro, B. Series: Cambridge Studies in Advanced Mathematics. Num Pages: 278 pages, 75 b/w illus. BIC Classification: PBV; PBW. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 17. Weight in Grams: 578. . 2004. Hardback. . . . . Books ship from the US and Ireland.…

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - The study of algorithmic graph theory and structured families of graphs is an important branch of discrete mathematics. It finds numerous applications, from data transmission through networks to efficiently scheduling aircraft and crews, as well as contributing to breakthroughs in genetic analysis and studies of the brain. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. One of these is the study of tolerance graphs and tolerance orders. This book contains the first thorough study of tolerance graphs and related topics, indeed the authors have included proofs of major results previously unpublished in book form. It will act as a springboard for researchers, and especially graduate students, to pursue new directions of investigation. With many examples and exercises it is also suitable for use as the text for a graduate course in graph theory.…

Condition: New. pp. xii + 265.

Hardcover. Condition: Brand New. 1st edition. 278 pages. 9.00x6.25x0.75 inches. In Stock.

Hardback. Condition: New. The study of algorithmic graph theory and structured families of graphs is an important branch of discrete mathematics. It finds numerous applications, from data transmission through networks to efficiently scheduling aircraft and crews, as well as contributing to breakthroughs in genetic analysis and studies of the brain. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. One of these is the study of tolerance graphs and tolerance orders. This book contains the first thorough study of tolerance graphs and related topics, indeed the authors have included proofs of major results previously unpublished in book form. It will act as a springboard for researchers, and especially graduate students, to pursue new directions of investigation. With many examples and exercises it is also suitable for use as the text for a graduate course in graph theory.…

Condition: New. Print on Demand pp. xii + 265 Illus.

Condition: New. PRINT ON DEMAND pp. xii + 265.