Words and Graphs [electronic resource] / by Sergey Kitaev, Vadim Lozin.
By: Kitaev, Sergey [author.].
Contributor(s): Lozin, Vadim [author.] | SpringerLink (Online service).
Material type: BookSeries: Monographs in Theoretical Computer Science. An EATCS Series: Publisher: Cham : Springer International Publishing : Imprint: Springer, 2015Description: XVIII, 264 p. 137 illus. in color. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319258591.Subject(s): Computer science | Computers | Computer science -- Mathematics | Algebra | Computer Science | Theory of Computation | Mathematics of Computing | AlgebraAdditional physical formats: Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access onlineIntroduction -- Hereditary Classes of Graphs -- What Word-Representable Graphs Are and Where They Come From -- Characterization of Word-Representable Graphs in Terms of Semi-transitive Orientations -- Various Results on Word-Representable Graphs -- Open Problems and Further Research Directions on Word-Representable Graphs -- Interrelations Between Words and Graphs in the Literature -- More on Interrelations Between Words and Graphs in the Literature -- App. A: Graph Theory Background -- App. B: Beyond Graph Theory Background.
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. .
There are no comments for this item.