TY - BOOK ID - 8360028 TI - Words and graphs AU - Kitaev, Sergey. AU - Lozin, Vadim. PY - 2015 SN - 3319258575 3319258591 PB - Cham : Springer International Publishing : Imprint: Springer, DB - UniCat KW - Computer Science KW - Engineering & Applied Sciences KW - Graph theory. KW - Representations of graphs. KW - Graphs, Representations of KW - Graph theory KW - Graphs, Theory of KW - Theory of graphs KW - Extremal problems KW - Computer science. KW - Computers. KW - Computer science KW - Algebra. KW - Computer Science. KW - Theory of Computation. KW - Mathematics of Computing. KW - Mathematics. KW - Combinatorial analysis KW - Topology KW - Information theory. KW - Mathematics KW - Mathematical analysis KW - Informatics KW - Science KW - Communication theory KW - Communication KW - Cybernetics KW - Computer science—Mathematics. KW - Automatic computers KW - Automatic data processors KW - Computer hardware KW - Computing machines (Computers) KW - Electronic brains KW - Electronic calculating-machines KW - Electronic computers KW - Hardware, Computer KW - Computer systems KW - Machine theory KW - Calculators KW - Cyberspace KW - Computer mathematics KW - Electronic data processing UR - https://www.unicat.be/uniCat?func=search&query=sysid:8360028 AB - 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. . ER -