Graphs capturing alternations in words

Halldorsson, Magnus and Kitaev, Sergey and Pyatkin, Artem; Gao, Yuan and Lu, Hanlin and Seki, Shinnosuke and Yu, Sheng, eds. (2010) Graphs capturing alternations in words. In: Developments in Language Theory. Lecture Notes in Computer Science . Springer-Verlag Berlin, CAN, pp. 436-437. ISBN 978-3-642-14454-7 (https://doi.org/10.1007/978-3-642-14455-4_41)

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. If W is k-uniform (each letter of W occurs exactly k times in it) then G is called k-representable. A graph is representable if and only if it is k-representable for some k [1].

• Share and Export
  

  RDF+XMLBibTeXRIOXX2 XMLRDF+N-TriplesJSONDublin CoreAtomSimple MetadataReferMETSHTML CitationASCII CitationOpenURL ContextObjectEndNoteOpenURL ContextObject in SpanMODSMPEG-21 DIDLEP3 XMLData Cite XMLRIS (EndNote Online, Zotero, Ref manager, etc)RDF+N3Multiline CSV
• Item metadata

  Item type:	Book Section
  ID code:	49969
  Dates:	Date Event 2010 Published
  Subjects:	Science > Mathematics > Electronic computers. Computer science
  Department:	Faculty of Science > Computer and Information Sciences
  Depositing user:	Pure Administrator
  Date deposited:	21 Oct 2014 14:14
  Last modified:	08 Apr 2024 13:14
  Related URLs:	https://personal.cis.strath.ac.uk/sergey...
  URI:	https://strathprints.strath.ac.uk/id/eprint/49969