1 citations · 1 across the 1 of their papers we have counts for
3 papers
math.CO2016
On the representation number of a crown graph
Marc Glen, Sergey Kitaev, Artem Pyatkin
A graph is word-representable if there exists a word over the alphabet such that letters and alternate in if and only if is an edge in . It is…
math.CO2016
Colourability and word-representability of near-triangulations
Marc Elliot Glen
A graph is word-representable if there is a word over the alphabet such that and alternate in if and only if the edge is in . It is know…
math.CO2015★ 1 cited
Word-representability of triangulations of rectangular polyomino with a single domino tile
Marc Glen, Sergey Kitaev
A recent elegant result of Akrobotu et al. states that a triangulation of any convex polyomino is word-representable if and only if it is 3-colorable. In this paper, we generalize…