Order Total (1 Item Items):
Shipping Destination:
Graph Colouring Probabilistic Method by Molloy (15 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (15)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (7)
- As New, Fine or Near Fine (5)
- Very Good or Good (1)
- Fair or Poor (No further results match this refinement)
- As Described (2)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (1)
- Seller-Supplied Images (7)
- Not Print on Demand (15)
Language (2)
Free Shipping
Seller Location
Seller Rating
-
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 MOL 9783540421399 Sprache: Englisch Gewicht in Gramm: 1150.
-
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 MOL 9783540421399 Sprache: Englisch Gewicht in Gramm: 550.
-
Graph Colouring and the Probabilistic Method (Algorithms and Combinatorics, 23, Band 23)
Language: English
Published by Berlin. Springer Verlag., 2002
ISBN 10: 3540421394 ISBN 13: 9783540421399
Karton Karton. Condition: Sehr gut. 326 Seiten, mit Abbildungen, Zust: Gutes Exemplar. Mit original Schutzumschlag. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post. Sprache: Englisch Gewicht in Gramm: 640.
-
Graph Colouring and the Probabilistic Method
Language: English
Published by Springer-Verlag GmbH, 2001
ISBN 10: 3540421394 ISBN 13: 9783540421399
£ 20.81 10% off£ 18.73
£ 90.69 shipping
Ships from Germany to U.S.A.Quantity: 1 available
Add to basketCondition: Sehr gut. Zustand: Sehr gut | Seiten: 326 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.
-
Graph Colouring and the Probabilistic Method
Language: English
Published by Springer-Verlag GmbH, 2001
ISBN 10: 3540421394 ISBN 13: 9783540421399
£ 20.81 10% off£ 18.73
£ 90.69 shipping
Ships from Germany to U.S.A.Quantity: 1 available
Add to basketCondition: Sehr gut. Zustand: Sehr gut | Seiten: 326 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.
-
hardcover. Condition: VeryGood. A copy that may have been read, very minimal wear and tear. May have a remainder mark.
-
Condition: New.
-
Condition: new.
-
Graph Colouring and the Probabilistic Method (Hardcover)
Language: English
Published by Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2001
ISBN 10: 3540421394 ISBN 13: 9783540421399
Hardcover. Condition: new. Hardcover. Over the past decade, many major advances have been made in the field of graph colouring via the probabilistic method. This monograph provides an accessible and unified treatment of these results, using tools such as the Lovasz Local Lemma and Talagrand's concentration inequality. The topics covered include: Kahn's proofs that the Goldberg-Seymour and List Colouring Conjectures hold asymptotically; a proof that for some absolute constant C, every graph of maximum degree Delta has a Delta+C total colouring; Johansson's proof that a triangle free graph has a O(Delta over log Delta) colouring; algorithmic variants of the Local Lemma which permit the efficient construction of many optimal and near-optimal colourings. This begins with a gentle introduction to the probabilistic method and will be useful to researchers and graduate students in graph theory, discrete mathematics, theoretical computer science and probability. Over the past decade, many major advances have been made in the field of graph colouring via the probabilistic method. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
hardcover. Condition: New. In shrink wrap. Looks like an interesting title!
-
Graph Colouring and the Probabilistic Method
Language: English
Published by Springer Berlin Heidelberg, 2001
ISBN 10: 3540421394 ISBN 13: 9783540421399
Condition: New. The book covers a topic of central interest to discrete mathematics.- The authors are two of the very best on this topic.Over the past decade, many major advances have been made in the field of graph colouring via the probabilistic method. This monograp.
-
Hardcover. Condition: Brand New. 2002 edition. 240 pages. 9.25x6.25x1.00 inches. In Stock.
-
Hardcover. Condition: Like New. Like New. book.
-
Condition: As New. Unread book in perfect condition.
-
Graph Colouring and the Probabilistic Method
Language: English
Published by Springer, Berlin, Springer, 2001
ISBN 10: 3540421394 ISBN 13: 9783540421399
Buch. Condition: Neu. Neuware - Over the past decade, many major advances have been made in the field of graph colouring via the probabilistic method. This monograph provides an accessible and unified treatment of these results, using tools such as the Lovasz Local Lemma and Talagrand's concentration inequality.The topics covered include: Kahn's proofs that the Goldberg-Seymour and List Colouring Conjectures hold asymptotically; a proof that for some absolute constant C, every graph of maximum degree Delta has a Delta+C total colouring; Johansson's proof that a triangle free graph has a O(Delta over log Delta) colouring; algorithmic variants of the Local Lemma which permit the efficient construction of many optimal and near-optimal colourings.This begins with a gentle introduction to the probabilistic method and will be useful to researchers and graduate students in graph theory, discrete mathematics, theoretical computer science and probability.
