On word-representability of polyomino triangulations

DOI10.3103/S1055134415010010zbMath1326.05028arXiv1405.3527MaRDI QIDQ894291

Sergey Kitaev, P. Akrobotu, Zuzana Masárová

Publication date: 30 November 2015

Published in: Siberian Advances in Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

triangulationsemi-transitive orientationword-representability(convex) polyomino

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62) Polyominoes (05B50)

Related Items (6)

Word-representability of triangulations of grid-covered cylinder graphs ⋮ Word-Representable Graphs: a Survey ⋮ Word-representability of face subdivisions of triangular grid graphs ⋮ On semi-transitive orientability of Kneser graphs and their complements ⋮ Solving computational problems in the theory of word-representable graphs ⋮ Representing graphs via pattern avoiding words

Cites Work

• New results on word-representable graphs
• Words and graphs
• Every planar map is four colorable. I: Discharging
• Alternation Graphs
• Graphs Capturing Alternations in Words
• On the Representability of Line Graphs
• Word-Representability of Line Graphs
• On representable graphs
• On graphs with representation number 3

This page was built for publication: On word-representability of polyomino triangulations