Picture of industrial chimneys polluting horizon

Open Access research shaping international environmental governance...

Strathprints makes available scholarly Open Access content exploring environmental law and governance, in particular the work of the Strathclyde Centre for Environmental Law & Governance (SCELG) based within the School of Law.

SCELG aims to improve understanding of the trends, challenges and potential solutions across different interconnected areas of environmental law, including capacity-building for sustainable management of biodiversity, oceans, lands and freshwater, as well as for the fight against climate change. The intersection of international, regional, national and local levels of environmental governance, including the customary laws of indigenous peoples and local communities, and legal developments by private actors, is also a signifcant research specialism.

Explore Open Access research by SCELG or the School of Law. Or explore all of Strathclyde's Open Access research...

A comprehensive introduction to the theory of word-representable graphs

Kitaev, Sergey (2017) A comprehensive introduction to the theory of word-representable graphs. In: Developments in Language Theory. Lecture Notes in Computer Science . Springer-Verlag, Berlin. (In Press)

[img]
Preview
Text (Kitaev-DLT-2017-A-comprehensive-introduction-to-the-theory-of-word-representable-graphs)
Kitaev_DLT_2017_A_comprehensive_introduction_to_the_theory_of_word_representable_graphs.pdf
Accepted Author Manuscript

Download (577kB) | Preview

Abstract

Letters x and y alternate in a word w if after deleting in w all letters but the copies of x and y we either obtain a word xyxy⋯ (of even or odd length) or a word yxyx⋯  (of even or odd length). A graph G=(V,E) is word-representable if and only if there exists a word w over the alphabet V such that letters x and y alternate in w if and only if xy ∈ E.   Word-representable graphs generalize several important classes of graphs such as circle graphs, 3-colorable graphs and comparability graphs. This paper offers a comprehensive introduction to the theory of word-representable graphs including the most recent developments in the area.