Solving computational problems in the theory of word-representable graphs

zbMath1407.05164arXiv1808.01215MaRDI QIDQ3120420

Özgür Akgün, Sergey Kitaev, Hans Zantema, Ian Philip Gent

Publication date: 4 March 2019

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

zbMATH Keywords

enumerationsemi-transitive orientationrepresentation numberword-representable graph\(k\)-semi-transitive orientation

Mathematics Subject Classification ID

Combinatorics on words (68R15) Graph representations (geometric and intersection representations, etc.) (05C62)

Uses Software

• nauty
• Yices
• OEIS
• Traces
• MINION

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Word-representability of triangulations of grid-covered cylinder graphs
• Word-representability of face subdivisions of triangular grid graphs
• New results on word-representable graphs
• On word-representability of polyomino triangulations
• Words and graphs
• Semi-transitive orientations and word-representable graphs
• Word problem of the Perkins semigroup via directed acyclic graphs.
• Automatically improving constraint models in Savile Row
• On graphs representable by pattern-avoiding words
• A comprehensive introduction to the theory of word-representable graphs
• Practical graph isomorphism. II.
• Alternation Graphs
• Graphs Capturing Alternations in Words
• On 132-representable Graphs
• Word-representability of triangulations of rectangular polyomino with a single domino tile
• On the Representability of Line Graphs
• Colourability and word-representability of near-triangulations
• S-crucial and bicrucial permutations with respect to squares
• On representable graphs
• On graphs with representation number 3

This page was built for publication: Solving computational problems in the theory of word-representable graphs