Word-representability of triangulations of grid-covered cylinder graphs

Abstract

A graph G = (V,E) is word-representable if there exists a word w over the alphabet V such that letters x and y, x 6= y, alternate in w if and only if (x, y) ∈ E. Halldórsson, Kitaev and Pyatkin have shown that a graph is word-representable if and only if it admits a so-called semi-transitive orientation. A corollary of this result is that any 3-colorable… (More)
DOI: 10.1016/j.dam.2016.05.025

19 Figures and Tables

Topics

  • Presentations referencing similar topics