James V. Rauff
Abstract
Two distinct letters x and y in a word alternate if, after deleting all other letters in the word, the resulting word is of the form xyxy : : : or yxyx : : : . A graph G = (V;E) is word-representable if there exists a word w over the alphabet V such that the letters x and y alternate in w if and only if there is an edge connecting x and y in G. If graphs can be represented by words then exciting new possibilities arise for investigating graph properties in terms of the properties of the words that represent them. In addition, words (i.e. strings) would offer an additional way of storing and manipulating graph structures in computation. This textbook is a comprehensive survey of word-representable graphs and the relationships between combinatorics on words and graph properties. The contents are accessible to graph theorists, formal language theorists, computer scientists, and students who have some familiarity with graph theory and words.
Recommendations
On graphs of central episturmian words
Episturmian sequences are a natural extension of Sturmian sequences to the case of finite alphabets of arbitrary cardinality. In this paper, we are interested in central episturmian words, or simply, epicentral words, i.e., the palindromic prefixes of ...
Comparability Graphs Among Cover-Incomparability Graphs
Algorithms and Discrete Applied MathematicsAbstractComparability graphs and cover-incomparability graphs (C-I graphs) are two interesting classes of graphs from posets. Comparability graph of a poset is a graph with vertex set V and two vertices u and v are adjacent in V if u and v are ...
Collapsible graphs and Hamiltonian connectedness of line graphs
Thomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai [Z.-H. Chen, H.-J. Lai, Reduction techniques for super-Eulerian graphs and related topics-an update, in: Ku Tung-Hsin (Ed.), Combinatorics and Graph Theory, vol. 95, ...
Comments