“UK pioneers Kitaev (Univ. of Strathclyde) and Lozin (Univ. of Warwick) now provide a first monographic treatment. Advanced undergraduates (no previous background is required) will gain access to an almost brand-new research area still rife with open problems. Summing Up: Recommended. Upper-division undergraduates through professionals/practitioners.” (D. V. Feldman, Choice, Vol. 54 (1), September, 2016)
This is the first comprehensive introduction to the theory of word-representable graphs, a generalization of several classical classes of graphs, and a new topic in discrete mathematics.
After extensive introductory chapters that explain the context and consolidate the state of the art in this field, including a chapter on hereditary classes of graphs, the authors suggest a variety of problems and directions for further research, and they discuss interrelations of words and graphs in the literature by means other than word-representability.
The book is self-contained, and is suitable for both reference and learning, with many chapters containing exercises and solutions to seleced problems. It will be valuable for researchers and graduate and advanced undergraduate students in discrete mathematics and theoretical computer science, in particular those engaged with graph theory and combinatorics, and also for specialists in algebra.
