A Comprehensive Introduction to the Theory of Word-Representable Graphs
Letters x and y alternate in a word w if after deleting in w all letters but the copies of x and y we either obtain a word \(xyxy\cdots \) (of even or odd length) or a word \(yxyx\cdots \) (of even or odd length). A graph \(G=(V,E)\) is word-representable if and only if there exists a word w over the alphabet V such that letters x and y alternate in w if and only if \(xy\in E\).
Word-representable graphs generalize several important classes of graphs such as circle graphs, 3-colorable graphs and comparability graphs. This paper offers a comprehensive introduction to the theory of word-represent-able graphs including the most recent developments in the area.
- 5.Gao, A., Kitaev, S., Zhang, P.: On 132-representable graphs. arXiv:1602.08965 (2016)
- 6.Glen, M.: Colourability and word-representability of near-triangulations. arXiv:1605.01688 (2016)
- 7.Glen, M.: Software. http://personal.cis.strath.ac.uk/sergey.kitaev/word-representable-graphs.html
- 8.Glen, M., Kitaev, S.: Word-representability of triangulations of rectangular polyomino with a single domino tile. J. Comb. Math. Comb. Comput. (to appear)Google Scholar
- 13.Kim, J., Kim, M.: Graph orientations on word-representable graphs (in preparation)Google Scholar
- 21.Mandelshtam, Y.: On graphs representable by pattern-avoiding words. arXiv:1608.07614 (2016)