Combinatorics and graph theory

This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum coloring.

This book provides a comprehensive and pedagogical introduction to graph theory and its applications.

In 1974 the editors of the present volume published a well-received book entitled ``Latin Squares and their Applications'.

Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field.