Graph Colouring and the Probabilistic Method
Graph Colouring and the Probabilistic Method

Author: Michael Molloy

Publisher: Springer Science & Business Media

Published: 2013-06-29

Total Pages: 320

ISBN-13: 3642040160

DOWNLOAD EBOOK

Over the past decade, many major advances have been made in the field of graph coloring via the probabilistic method. This monograph, by two of the best on the topic, provides an accessible and unified treatment of these results, using tools such as the Lovasz Local Lemma and Talagrand's concentration inequality.

Variations on a Graph Coloring Theme
Variations on a Graph Coloring Theme

Author: Bryan Phinezy

Publisher:

Published: 2012

Total Pages: 0

ISBN-13:

DOWNLOAD EBOOK

Historically, the subject of graph colorings has been the most popular research area in graph theory. There are many problems in mathematics and in real life that can be represented by a graph and whose solution involves finding a specific coloring of this graph. Our research consists of two parts: (1) combinatorial problems and vertex colorings and (2) distance-defined colorings. In this research, we show that certain combinatorial puzzles and problems can be placed in a graph coloring setting and graph colorings can be defined in terms of distance in graphs that are useful in applications.

Graph Colorings
Graph Colorings

Author: Marek Kubale

Publisher: American Mathematical Soc.

Published: 2004

Total Pages: 224

ISBN-13: 0821834584

DOWNLOAD EBOOK

Graph coloring is one of the oldest and best-known problems of graph theory. Statistics show that graph coloring is one of the central issues in the collection of several hundred classical combinatorial problems. This book covers the problems in graph coloring, which can be viewed as one area of discrete optimization.

Graph Colouring and Applications
Graph Colouring and Applications

Author: Pierre Hansen

Publisher: American Mathematical Soc.

Published: 1999

Total Pages: 168

ISBN-13: 9780821819555

DOWNLOAD EBOOK

This volume presents the proceedings of the CRM workshop on graph coloring and applications. The articles span a wide spectrum of topics related to graph coloring, including: list-colorings, total colorings, colorings and embeddings of graphs, chromatic polynomials, characteristic polynomials, chromatic scheduling, and graph coloring problems related to frequency assignment. Outstanding researchers in combinatorial optimization and graph theory contributed their work. A list of open problems is included.

Graph Coloring Problems
Graph Coloring Problems

Author: Tommy R. Jensen

Publisher: John Wiley & Sons

Published: 2011-10-24

Total Pages: 320

ISBN-13: 1118030745

DOWNLOAD EBOOK

Contains a wealth of information previously scattered in research journals, conference proceedings and technical reports. Identifies more than 200 unsolved problems. Every problem is stated in a self-contained, extremely accessible format, followed by comments on its history, related results and literature. The book will stimulate research and help avoid efforts on solving already settled problems. Each chapter concludes with a comprehensive list of references which will lead readers to original sources, important contributions and other surveys.