Michael Stiebitz – författare

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.

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.

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.

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.