On graphs representable by pattern-avoiding words

DOI10.7151/dmgt.2128zbMath1404.05132arXiv1608.07614OpenAlexW2964145325MaRDI QIDQ1717191

Yelena Mandelshtam

Publication date: 7 February 2019

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.07614

zbMATH Keywords

pattern-avoidanceword-representabilitycircle graphs

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Solving computational problems in the theory of word-representable graphs ⋮ Wiener-type indices of Parikh word representable graphs

Cites Work

• Patterns in permutations and words.
• Words and graphs
• Semi-transitive orientations and word-representable graphs
• On 132-representable Graphs
• Combinatorics of Compositions and Words
• On representable graphs

This page was built for publication: On graphs representable by pattern-avoiding words