selected topics graph theory (27 Ergebnisse)

Hardcover. 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. 05 SEL 9780120862504 Sprache: Englisch Gewicht in Gramm: 1150.

hardcover. Zustand: Good. 5th Edition. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).

Hard Cover. Zustand: Good. No Jacket. First Edition. From an academic library with the usual stamps etc. Spine very faded.

Cloth. Zustand: Good. Zustand des Schutzumschlags: Good. Type: Book Small plain label inside cover.

Zustand: New. In English.

Paperback. Zustand: New.

hardcover. Zustand: New. 5th Edition. Ships in a BOX from Central Missouri! UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).

Taschenbuch. Zustand: Neu. Reducibility of Graphs and Digraphs | Selected Topics in Graph Theory | Akram Attar (u. a.) | Taschenbuch | 148 S. | Englisch | 2013 | LAP LAMBERT Academic Publishing | EAN 9783659408458 | Verantwortliche Person für die EU: OmniScriptum GmbH & Co. KG, Bahnhofstr. 28, 66111 Saarbrücken, info[at]akademikerverlag[dot]de | Anbieter: preigu.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Hardcover. Zustand: new. Hardcover. The first half of the book walks the reader through methods of counting, both direct elementary methods and the more advanced method of generating functions. Then, in the second half of the book, the reader learns how to apply these methods to fascinating objects, such as graphs, designs, random variables, partially ordered sets, and algorithms. In short, the first half emphasizes depth by discussing counting methods at length; the second half aims for breadth, by showing how numerous the applications of our methods are.New to this fifth edition of A Walk Through Combinatorics is the addition of Instant Check exercises more than a hundred in total which are located at the end of most subsections. As was the case for all previous editions, the exercises sometimes contain new material that was not discussed in the text, allowing instructors to spend more time on a given topic if they wish to do so. With a thorough introduction into enumeration and graph theory, as well as a chapter on permutation patterns (not often covered in other textbooks), this book is well suited for any undergraduate introductory combinatorics class. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Hardback. Zustand: New. The first half of the book walks the reader through methods of counting, both direct elementary methods and the more advanced method of generating functions. Then, in the second half of the book, the reader learns how to apply these methods to fascinating objects, such as graphs, designs, random variables, partially ordered sets, and algorithms. In short, the first half emphasizes depth by discussing counting methods at length; the second half aims for breadth, by showing how numerous the applications of our methods are.New to this fifth edition of A Walk Through Combinatorics is the addition of Instant Check exercises - more than a hundred in total - which are located at the end of most subsections. As was the case for all previous editions, the exercises sometimes contain new material that was not discussed in the text, allowing instructors to spend more time on a given topic if they wish to do so. With a thorough introduction into enumeration and graph theory, as well as a chapter on permutation patterns (not often covered in other textbooks), this book is well suited for any undergraduate introductory combinatorics class.

hardcover. Zustand: New.

Zustand: New. 2023. 5th Edition. hardcover. . . . . .

Hardback. Zustand: New. The first half of the book walks the reader through methods of counting, both direct elementary methods and the more advanced method of generating functions. Then, in the second half of the book, the reader learns how to apply these methods to fascinating objects, such as graphs, designs, random variables, partially ordered sets, and algorithms. In short, the first half emphasizes depth by discussing counting methods at length; the second half aims for breadth, by showing how numerous the applications of our methods are.New to this fifth edition of A Walk Through Combinatorics is the addition of Instant Check exercises - more than a hundred in total - which are located at the end of most subsections. As was the case for all previous editions, the exercises sometimes contain new material that was not discussed in the text, allowing instructors to spend more time on a given topic if they wish to do so. With a thorough introduction into enumeration and graph theory, as well as a chapter on permutation patterns (not often covered in other textbooks), this book is well suited for any undergraduate introductory combinatorics class.

Hardcover / Pappband. Zustand: Gut. 116 S. Kombinatorik Spine mildly damaged. Guter Zustand/ Good Ex-Library. With ill. Cover shows wear. ha1062431 Sprache: Englisch Gewicht in Gramm: 300.

Hardback. Zustand: New. The first half of the book walks the reader through methods of counting, both direct elementary methods and the more advanced method of generating functions. Then, in the second half of the book, the reader learns how to apply these methods to fascinating objects, such as graphs, designs, random variables, partially ordered sets, and algorithms. In short, the first half emphasizes depth by discussing counting methods at length; the second half aims for breadth, by showing how numerous the applications of our methods are.New to this fifth edition of A Walk Through Combinatorics is the addition of Instant Check exercises - more than a hundred in total - which are located at the end of most subsections. As was the case for all previous editions, the exercises sometimes contain new material that was not discussed in the text, allowing instructors to spend more time on a given topic if they wish to do so. With a thorough introduction into enumeration and graph theory, as well as a chapter on permutation patterns (not often covered in other textbooks), this book is well suited for any undergraduate introductory combinatorics class.

Zustand: New. 2023. 5th Edition. hardcover. . . . . . Books ship from the US and Ireland.

Hardcover. Zustand: Brand New. 5th edition. 613 pages. 9.25x6.25x1.50 inches. In Stock.

Hardcover. Zustand: new. Hardcover. The first half of the book walks the reader through methods of counting, both direct elementary methods and the more advanced method of generating functions. Then, in the second half of the book, the reader learns how to apply these methods to fascinating objects, such as graphs, designs, random variables, partially ordered sets, and algorithms. In short, the first half emphasizes depth by discussing counting methods at length; the second half aims for breadth, by showing how numerous the applications of our methods are.New to this fifth edition of A Walk Through Combinatorics is the addition of Instant Check exercises more than a hundred in total which are located at the end of most subsections. As was the case for all previous editions, the exercises sometimes contain new material that was not discussed in the text, allowing instructors to spend more time on a given topic if they wish to do so. With a thorough introduction into enumeration and graph theory, as well as a chapter on permutation patterns (not often covered in other textbooks), this book is well suited for any undergraduate introductory combinatorics class. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Hardback. Zustand: New. The first half of the book walks the reader through methods of counting, both direct elementary methods and the more advanced method of generating functions. Then, in the second half of the book, the reader learns how to apply these methods to fascinating objects, such as graphs, designs, random variables, partially ordered sets, and algorithms. In short, the first half emphasizes depth by discussing counting methods at length; the second half aims for breadth, by showing how numerous the applications of our methods are.New to this fifth edition of A Walk Through Combinatorics is the addition of Instant Check exercises - more than a hundred in total - which are located at the end of most subsections. As was the case for all previous editions, the exercises sometimes contain new material that was not discussed in the text, allowing instructors to spend more time on a given topic if they wish to do so. With a thorough introduction into enumeration and graph theory, as well as a chapter on permutation patterns (not often covered in other textbooks), this book is well suited for any undergraduate introductory combinatorics class.

Zustand: Used: Good. former xlibrary 1983 hardcover no dust jacket as issued volume 2 withdrawn stamp in book clean unmarked pages stamps on edge of pages has library book plate and call label at bottom of bind 301 pages rare and out of print title{{{ K-11.

Academic Press, London, 1978. 451 S., Pappband mit Schutzumschlag--- - Text englisch - 856 Gramm.

PAP. Zustand: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

PAP. Zustand: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Reducibility of Graphs is one of the importent subject in the restrection problem in Graph Theory.In fact the deletion of vertices(edges) from the graph with certain property, may not maintain the property of the graph. When the graph maintain its property after deletion vertex(edge) from its vertex(edge) set means that we can study the graph with fewer vertices(edges) which simpilfie our study for this graph.

Hardcover. Zustand: Brand New. 5th edition. 613 pages. 9.25x6.25x1.50 inches. In Stock. This item is printed on demand.