This is a book about graph homomorphisms. Graph theory is now an established discipline
but the study of graph homomorphisms has only recently begun to gain wide acceptance …

This in-depth coverage of important areas of graph theory maintains a focus on symmetry
properties of graphs. Standard topics on graph automorphisms are presented early on, while …

In this paper, we relate a beautiful theory by Lov\'asz with a popular heuristic algorithm for
the graph isomorphism problem, namely the color refinement algorithm and its k …

The problem of counting homomorphisms from a general graph G to a fixed graph H is a
natural generalization of graph coloring, with important applications in statistical physics …

Counting homomorphisms between graphs (often with weights) comes up in a wide variety
of areas, including extremal graph theory, properties of graph products, partition functions in …

The time has now come when graph theory should be part of the education of every serious
student of mathematics and computer science, both for its own sake and to enhance the …

Graph Theory and Computing focuses on the processes, methodologies, problems, and
approaches involved in graph theory and computer science. The book first elaborates on …

This book provides a rapid introduction to topics in graph theory typically covered in a
graduate course. The author sets out the main recent results in several areas of current …

This book is intended to be an introductory text for mathematics and computer science
students at the second and third year levels in universities. It gives an introduction to the …

Let hom (G, H) be the number of homomorphisms from a graph G to a graph H. A well‐
known result of Lovász states that the function hom (·, H) from all graphs uniquely …