Graph colorings
Author(s)
Bibliographic Information
Graph colorings
(Contemporary mathematics, v. 352)
American Mathematical Society, c2004
- Other Title
-
Optymalizacja dyskretna : modele i metody kolorowania grafów
Available at 44 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
"Originally published in Polish by Wydawnictwa Naukowo-Techniczne under the title 'Optymalizacja dyskretna : modele i metody kolorowania grafów', c2002"--T.p. verso
Includes bibliographical references (p. 189-201) and index
Description and Table of Contents
Description
Graph coloring is one of the oldest and best-known problems of graph theory. As people grew accustomed to applying the tools of graph theory to the solutions of real-world 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 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.
Table of Contents
Classical coloring of graphs by A. Kosowski and K. Manuszewski On-line coloring of graphs by P. Borowiecki Equitable coloring of graphs by H. Furmanczyk Sum coloring of graphs by M. Malafiejski $T$-coloring of graphs by R. Janczewski Rank coloring of graphs by D. Dereniowski Harmonious coloring of graphs by M. Kubale Interval edge-coloring of graphs by K. Giaro Circular coloring of graphs by A. Nadolski Path coloring and routing in graphs by J. Bialogrodzki List colorings of graphs by K. Piwakowski Ramsey colorings of complete graphs by T. Dzido Placing guards in art galleries by graph coloring by P. Zylinski Bibliography Index Authors' addresses.
by "Nielsen BookData"