9783319258577 - Words and Graphs (Monographs in Theoretical Computer Science. An EATCS Series) von Kitaev, Sergey; Lozin, Vadim (10 Ergebnisse)

Zustand: New. pp.

Hardcover. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Zustand: new. Questo è un articolo print on demand.

Buch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 284 pp. Englisch.

Gebunden. Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Self-contained survey, useful for learning and reference Authors among key researchers in this fieldSuggests problems and directions for further researchDr. Sergey Kitaev is a Reader in Combinatorics in the Department of Compute.

Zustand: New. Print on Demand pp.

Zustand: New. PRINT ON DEMAND pp.

Buch. Zustand: Neu. Words and Graphs | Sergey Kitaev (u. a.) | Buch | xviii | Englisch | 2015 | Springer | EAN 9783319258577 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.

Buch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 willbe 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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 284 pp. Englisch.

Buch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.