Kitaev, Sergey and Pyatkin, Artem (2008) On representable graphs. Journal of Automata, Languages and Combinatorics, 13 (1). pp. 45-54.Full text not available in this repository. Request a copy from the Strathclyde author
A graph G = (V;E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x; y) 2 E for each x 6= y. If W is k-uniform (each letter of W occurs exactly k times in it) then G is called k-representable. We prove that a graph is representable if and only if it is k-representable for some k. Examples of non-representable graphs are found in this paper. Some wide classes of graphs are proven to be 2- and 3-representable. Several open problems are stated.
|Keywords:||combinatorics on words, representation, (outer)planar graphs, prisms, Perkins semigroup, graph subdivisions, Mathematics|
|Subjects:||Science > Mathematics|
|Department:||Faculty of Science > Computer and Information Sciences|
|Depositing user:||Pure Administrator|
|Date Deposited:||17 Oct 2014 15:33|
|Last modified:||28 Feb 2017 01:09|