@inproceedings{568aa8f852c54edebf343569bd1ca4c0,

title = "On the representability of line graphs",

abstract = "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) ∈ E for each x ≠ y. Such a W is called a word-representant of G. Note that in this paper we use the term graph to mean a finite, simple graph, even though the definition of representable is applicable to more general graphs.",

keywords = "logics, line graphs, meanings of programs",

author = "Sergey Kitaev and Pavel Salimov and Christopher Severs and Henning Ulfarsson",

year = "2011",

doi = "10.1007/978-3-642-22321-1_46",

language = "English",

isbn = "978-3-642-22320-4",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "478--479",

editor = "Giancarlo Mauri and Alberto Leporati",

booktitle = "Developments in Language Theory",

note = "15th Conference on Developments in Language Theory ; Conference date: 19-07-2011 Through 22-07-2011",

}