A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Solving computational problems in the theory of word-representable graphs
[article]
2018
arXiv
pre-print
A simple graph G=(V,E) is word-representable if there exists a word w over the alphabet V such that letters x and y alternate in w iff xy∈ E. Word-representable graphs generalize several important classes of graphs. A graph is word-representable iff it admits a semi-transitive orientation. We use semi-transitive orientations to enumerate connected non-word-representable graphs up to the size of 11 vertices, which led to a correction of a published result. Obtaining the enumeration results took
arXiv:1808.01215v1
fatcat:yzl3vjtnajce3jxyi2g4nxwyna