Graph Colorings

Front Cover
Marek Kubale
American Mathematical Society, Jun 11, 2004 - Science - 208 pages
0 Reviews
This book is devoted to problems in graph coloring, which can be viewed as one area of discrete optimization. Chapters are dedicated to various models and are largely independent of one another. In each chapter, the author highlights algorithmic aspects of the presented models, i.e., the construction of polynomial-time algorithms for graph coloring. This is an expanded and updated translation of the prizewinning book originally published in Polish, Optymalizacja dyskretna. Modele i metody kolorowania grafow. It is suitable for graduate students and researchers interested in graph theory.

What people are saying - Write a review

We haven't found any reviews in the usual places.

Other editions - View all

References to this book

Bibliographic information