عنوان

Graph edge coloring :Vizing's theorem and Goldberg's conjecture

عنوان اصلي

Graph edge coloring :Vizing's theorem and Goldberg's conjecture

محل نشرو پخش و غیره

Hoboken, N.J.

نام ناشر، پخش کننده و غيره

Wiley

تاریخ نشرو بخش و غیره

c2012

نام خاص و کميت اثر

xiv, 321 p. : ill. ; 24 cm.

ساير اطلاعات عنواني

Wiley series in discrete mathematics and 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 historial 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"-- Provided by publisher

متن يادداشت

Includes bibliographical references and indexes

متن يادداشت

Michael Stiebitz ... ]et al.[

متن يادداشت

1

عنصر شناسه ای

، Graph coloring

عنصر شناسه ای

، Graph theory

شماره

شماره رده

کد نقش

TI

عنصر شناسه اي

AU Stiebitz, Michael 1954-

عنصر شناسه اي

SE

عنصر شناسه اي

SE Wiley series in discrete mathematics and optimization