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
.
Colourability and word-representability of near-triangulations
[article]
2018
arXiv
pre-print
A graph G = (V,E) is word-representable if there is a word w over the alphabet V such that x and y alternate in w if and only if the edge (x, y) is in G. It is known [6] that all 3-colourable graphs are word-representable, while among those with a higher chromatic number some are word-representable while others are not. There has been some recent research on the word-representability of polyomino triangulations. Akrobotu et al.[1] showed that a triangulation of a convex polyomino is
arXiv:1605.01688v4
fatcat:xarieqfk2ngrrnvxvgdyhws6xq