Skip to main content
SpringerLink
Log in

On the Representability of Line Graphs

  • Conference paper
Developments in Language Theory (DLT 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6795))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Halldórsson, M., Kitaev, S., Pyatkin, A.: Graphs capturing alternations in words. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 436–437. Springer, Heidelberg (2010)

    Article  MathSciNet  MATH  Google Scholar 

  2. Halldórsson, M., Kitaev, S., Pyatkin, A.: On representable graphs, semi-transitive orientations, and the representation numbers, arXiv:0810.0310v1 (math.CO) (2008)

    Google Scholar 

  3. Halldórsson, M., Kitaev, S., Pyatkin, A.: Graphs capturing alternations in words. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 436–437. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Kitaev, S., Pyatkin, A.: On representable graphs. Automata, Languages and Combinatorics 13, 1, 45–54 (2008)

    Google Scholar 

  5. Kitaev, S., Seif, S.: Word problem of the Perkins semigroup via directed acyclic graphs. Order (2008), doi:10.1007/s11083-008-9083-7

    Google Scholar 

  6. van Rooij, A.C.M., Wilf, H.S.: M van Rooij and H.S. Wilf. The interchange graph of a finite graph. Acta Mathematica Academiae Scientiarum Hungaricae 16, 263–269 (1965)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Reykjavik University, Menntavegi 1, 101, Reykjavik, Iceland

    Sergey Kitaev, Pavel Salimov, Christopher Severs & Henning Úlfarsson

  2. Department of Computer and Information Sciences, University of Strathclyde, Livingstone Tower, 26 Richmond Street, Glasgow, G1 1XH, UK

    Sergey Kitaev

Authors
  1. Sergey Kitaev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pavel Salimov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christopher Severs
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Henning Úlfarsson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Viale Sarca 336, Edificio U14, 20126, Milano, Italy

    Giancarlo Mauri  & Alberto Leporati  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kitaev, S., Salimov, P., Severs, C., Úlfarsson, H. (2011). On the Representability of Line Graphs. In: Mauri, G., Leporati, A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22321-1_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22321-1_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22320-4

  • Online ISBN: 978-3-642-22321-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation