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 xy. 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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Kitaev, S., Salimov, P., Severs, C., & Úlfarsson, H. (2011). On the representability of line graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6795 LNCS, pp. 478–479). https://doi.org/10.1007/978-3-642-22321-1_46
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
