Titlebook: Words and Graphs; Sergey Kitaev,Vadim Lozin Book 2015 Springer International Publishing Switzerland 2015 Combinatorics.Complexity.Enumerat

overshadow

Introduction,mbinatorics on words. This theory is discussed in Chapters 3{5, where we provide all necessary definitions and examples, as well as a proof of every statement we make along with references to the original sources.

ANA

dapper

萬神殿

注入

Various Results on Word-Representable Graphs,For what follows, recall from Dffnition 3.2.3 that for a word-representable graph ., its representation number . is the minimal . such that . is .-word-representable.

圣人

Representing Graphs via Pattern-Avoiding Words,Chapters 3—5 study the notion of word-representable graphs. This chapter, based on [84, 90], provides a far-reaching generalization of the notion of a word-representable graph, namely that of a . Section 7.7 contains other ways, including another generalization, to define the notion of word-representability.

evasive

宇宙你

More on Interrelations Between Words and Graphs,Chapter 8 gives examples of interrelations between words and graphs in the literature. In this chapter, we provide a few more such examples that include Gray codes, the snake-in-the-box problem, de Bruijn graphs and graphs of overlapping permutations, and finding independent sets in path-schemes.

Guaff豪情痛飲

Sergey Kitaev,Vadim LozinSelf-contained survey, useful for learning and reference.Authors among key researchers in this field.Suggests problems and directions for further research

TEN

978-3-319-35669-3Springer International Publishing Switzerland 2015