### Abstract

Language | English |
---|---|

Title of host publication | Developments in Language Theory |

Subtitle of host publication | 15th International Conference, DLT 2011, Milan, Italy, July 19-22, 2011. Proceedings |

Editors | Giancarlo Mauri, Alberto Leporati |

Pages | 478-479 |

Number of pages | 2 |

DOIs | |

Publication status | Published - 2011 |

Event | 15th Conference on Developments in Language Theory - University of Milano-Bicocca, Milan, United Kingdom Duration: 19 Jul 2011 → 22 Jul 2011 |

### Publication series

Name | Lecture Notes in Computer Science |
---|---|

Publisher | Springer |

Volume | 6795 |

ISSN (Print) | 0302-9743 |

### Conference

Conference | 15th Conference on Developments in Language Theory |
---|---|

Country | United Kingdom |

City | Milan |

Period | 19/07/11 → 22/07/11 |

### Keywords

- logics
- line graphs
- meanings of programs

### Cite this

*Developments in Language Theory: 15th International Conference, DLT 2011, Milan, Italy, July 19-22, 2011. Proceedings*(pp. 478-479). (Lecture Notes in Computer Science; Vol. 6795). https://doi.org/10.1007/978-3-642-22321-1_46

}

*Developments in Language Theory: 15th International Conference, DLT 2011, Milan, Italy, July 19-22, 2011. Proceedings.*Lecture Notes in Computer Science, vol. 6795, pp. 478-479, 15th Conference on Developments in Language Theory, Milan, United Kingdom, 19/07/11. https://doi.org/10.1007/978-3-642-22321-1_46

**On the representability of line graphs.** / Kitaev, Sergey; Salimov, Pavel; Severs, Christopher; Ulfarsson, Henning.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution book

TY - GEN

T1 - On the representability of line graphs

AU - Kitaev, Sergey

AU - Salimov, Pavel

AU - Severs, Christopher

AU - Ulfarsson, Henning

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - logics

KW - line graphs

KW - meanings of programs

U2 - 10.1007/978-3-642-22321-1_46

DO - 10.1007/978-3-642-22321-1_46

M3 - Conference contribution book

SN - 978-3-642-22320-4

T3 - Lecture Notes in Computer Science

SP - 478

EP - 479

BT - Developments in Language Theory

A2 - Mauri, Giancarlo

A2 - Leporati, Alberto

ER -