EUR 107,56
Cantidad disponible: 15 disponibles
Añadir al carritoHRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 105,35
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 114,42
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 114,60
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 107,54
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 116,13
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 137,10
Cantidad disponible: 3 disponibles
Añadir al carritoCondición: New. pp. xiv + 321 Illus.
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 124,62
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. New copy - Usually dispatched within 4 working days.
EUR 145,89
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. xiv + 321.
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Original o primera edición
EUR 142,67
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Written by world authorities on graph theory, this book features many new advances and applications in graph edge coloring, describes how the results are interconnected, and provides historical context throughout. Num Pages: 344 pages, Illustrations. BIC Classification: PB; UY. Category: (P) Professional & Vocational. Dimension: 240 x 163 x 24. Weight in Grams: 642. . 2012. 1st Edition. Hardcover. . . . .
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 159,48
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 154,64
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 162,59
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 1st edition. 344 pages. 9.19x6.48x1.04 inches. In Stock.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 166,09
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 184,13
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 178,70
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Written by world authorities on graph theory, this book features many new advances and applications in graph edge coloring, describes how the results are interconnected, and provides historical context throughout. Num Pages: 344 pages, Illustrations. BIC Classification: PB; UY. Category: (P) Professional & Vocational. Dimension: 240 x 163 x 24. Weight in Grams: 642. . 2012. 1st Edition. Hardcover. . . . . Books ship from the US and Ireland.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 183,53
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Springer International Publishing AG, CH, 2024
ISBN 10: 3031500644 ISBN 13: 9783031500640
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
EUR 214,21
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. 2024 ed.
EUR 157,95
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Brooks' Theorem | Graph Coloring and Critical Graphs | Michael Stiebitz (u. a.) | Taschenbuch | Springer Monographs in Mathematics | xiv | Englisch | 2025 | Springer | EAN 9783031500671 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 167,99
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. Neuware - Written by world authorities on graph theory, this book features many new advances and applications in graph edge coloring, describes how the results are interconnected, and provides historical context throughout. Chapter coverage includes an introduction to coloring preliminaries and lower and upper bounds; the Vizing fan; the Kierstead path; simple graphs and line graphs of multigraphs; the Tashkinov tree; Goldberg s conjecture; extreme graphs; generalized edge coloring; and open problems. It serves as a reference for researchers interested in discrete mathematics, graph theory, operations research, theoretical computer science, and combinatorial optimization, as well as a graduate-level course book for students of mathematics, optimization, and computer science.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 235,42
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 243,17
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. 2024th edition NO-PA16APR2015-KAP.
Idioma: Inglés
Publicado por Springer Nature Switzerland, Springer Nature Switzerland, 2025
ISBN 10: 3031500679 ISBN 13: 9783031500671
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 181,89
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering.
Idioma: Inglés
Publicado por Springer Nature Switzerland Mär 2024, 2024
ISBN 10: 3031500644 ISBN 13: 9783031500640
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 181,89
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Brooks' Theorem (1941) is one of the most famous and fundamental theorems in graph theory - it is mentioned/treated in all general monographs on graph theory. It has sparked research in several directions. This book presents a comprehensive overview of this development and see it in context. It describes results, both early and recent, and explains relations: the various proofs, the many extensions and similar results for other graph parameters. It serves as a valuable reference to a wealth of information, now scattered in journals, proceedings and dissertations. The reader gets easy access to this wealth of information in comprehensive form, including best known proofs of the results described. Each chapter ends in a note section with historical remarks, comments and further results. The book is also suitable for graduate courses in graph theory and includes exercises. The book is intended for readers wanting to dig deeper into graph coloring theory than what is possible in the existing book literature. There is a comprehensive list of references to original sources.
Idioma: Inglés
Publicado por Springer International Publishing AG, CH, 2024
ISBN 10: 3031500644 ISBN 13: 9783031500640
Librería: Rarewaves.com UK, London, Reino Unido
EUR 203,46
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. 2024 ed.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 282,11
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 669 pages. 9.25x6.10x9.21 inches. In Stock.
EUR 215,44
Cantidad disponible: 6 disponibles
Añadir al carritoHardback. Condición: New. 4.
EUR 204,63
Cantidad disponible: 6 disponibles
Añadir al carritoHardback. Condición: New. 4.
Idioma: Inglés
Publicado por John Wiley & Sons Inc, New York, 2012
ISBN 10: 111809137X ISBN 13: 9781118091371
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Original o primera edición Impresión bajo demanda
EUR 130,70
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: new. Hardcover. Features recent advances and new applications in graph edge coloring Reviewing recent advances in the Edge Coloring Problem, Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture provides an overview of the current state of the science, explaining the interconnections among the results obtained from important graph theory studies. The authors introduce many new improved proofs of known results to identify and point to possible solutions for open problems in edge coloring. The book begins with an introduction to graph theory and the concept of edge coloring. Subsequent chapters explore important topics such as: Use of Tashkinov trees to obtain an asymptotic positive solution to Goldberg's conjecture Application of Vizing fans to obtain both known and new results Kierstead paths as an alternative to Vizing fans Classification problem of simple graphs Generalized edge coloring in which a color may appear more than once at a vertex This book also features first-time English translations of two groundbreaking papers written by Vadim Vizing on an estimate of the chromatic class of a p-graph and the critical graphs within a given chromatic class. Written by leading experts who have reinvigorated research in the field, Graph Edge Coloring is an excellent book for mathematics, optimization, and computer science courses at the graduate level. The book also serves as a valuable reference for researchers interested in discrete mathematics, graph theory, operations research, theoretical computer science, and combinatorial optimization. Written by world authorities on graph theory, this book features many new advances and applications in graph edge coloring, describes how the results are interconnected, and provides historical context throughout. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 142,27
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.