Contemporary Mathematics 2004; 208 pp; softcover Volume: 352 ISBN10: 0821834584 ISBN13: 9780821834589 List Price: US$65 Member Price: US$52 Order Code: CONM/352
 Graph coloring is one of the oldest and bestknown problems of graph theory. As people grew accustomed to applying the tools of graph theory to the solutions of realworld technological and organizational problems, new chromatic models emerged as a natural way of tackling many practical situations. Statistics show that graph coloring is one of the central issues in the collection of several hundred classical combinatorial problems. 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 polynomialtime 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 grafów. It is suitable for graduate students and researchers interested in graph theory. Readership Graduate students and research mathematicians interested in graph theory. Table of Contents  A. Kosowski and K. Manuszewski  Classical coloring of graphs
 P. Borowiecki  Online coloring of graphs
 H. Furmańczyk  Equitable coloring of graphs
 M. Małafiejski  Sum coloring of graphs
 R. Janczewski  \(T\)coloring of graphs
 D. Dereniowski  Rank coloring of graphs
 M. Kubale  Harmonious coloring of graphs
 K. Giaro  Interval edgecoloring of graphs
 A. Nadolski  Circular coloring of graphs
 J. Białogrodzki  Path coloring and routing in graphs
 K. Piwakowski  List colorings of graphs
 T. Dzido  Ramsey colorings of complete graphs
 P. Żyliński  Placing guards in art galleries by graph coloring
 Bibliography
 Index
 Authors' addresses
