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.
- ISBN:
- 9780821834589
- 9780821834589
- Category:
- Combinatorics & graph theory
- Format:
- Paperback
- Publication Date:
- 30-06-2004
- Language:
- Polish
- Publisher:
- American Mathematical Society
- Country of origin:
- United States
- Pages:
- 208
- Dimensions (mm):
- 250x180mm
- Weight:
- 0.41kg
Click 'Notify Me' to get an email alert when this item becomes available
Great!
Click on Save to My Library / Lists
Click on Save to My Library / Lists
Select the List you'd like to categorise as, or add your own
Here you can mark if you have read this book, reading it or want to read
Awesome! You added your first item into your Library
Great! The fun begins.
Click on My Library / My Lists and I will take you there
Click on My Library / My Lists and I will take you there
Reviews
Be the first to review Graph Colorings.
Share This Book: