overshadow 发表于 2025-3-23 10:13:29

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 发表于 2025-3-23 16:01:12

http://reply.papertrans.cn/104/10308/1030730/1030730_12.png

dapper 发表于 2025-3-23 21:07:30

http://reply.papertrans.cn/104/10308/1030730/1030730_13.png

万神殿 发表于 2025-3-24 00:59:48

http://reply.papertrans.cn/104/10308/1030730/1030730_14.png

注入 发表于 2025-3-24 04:32:37

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.

圣人 发表于 2025-3-24 10:08:55

Representing Graphs via Pattern-Avoiding Words,Chapters 3—5 study the notion of word-representable graphs. This chapter, based on , 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 发表于 2025-3-24 13:34:41

http://reply.papertrans.cn/104/10308/1030730/1030730_17.png

宇宙你 发表于 2025-3-24 18:24:32

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豪情痛饮 发表于 2025-3-24 22:27:33

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 发表于 2025-3-25 01:45:43

978-3-319-35669-3Springer International Publishing Switzerland 2015
页: 1 [2] 3 4 5
查看完整版本: Titlebook: Words and Graphs; Sergey Kitaev,Vadim Lozin Book 2015 Springer International Publishing Switzerland 2015 Combinatorics.Complexity.Enumerat