ISBN: 9781118091371 - graph edge coloring: vizing's theorem and goldberg's conjecture (wiley series in discrete mathematics and optimization) (6 Ergebnisse)

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

Zustand: New. pp. xiv + 321 Illus.

Zustand: New. In English.

Hardcover. Zustand: Brand New. 1st edition. 344 pages. 9.19x6.48x1.04 inches. In Stock.

Zustand: 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. …

Buch. Zustand: 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.…