New results on word-representable graphs

Collins, Andrew and Kitaev, Sergey and Lozin, Vadim V. (2017) New results on word-representable graphs. Discrete Applied Mathematics, 216 (Part 1). pp. 136-141. ISSN 0166-218X (https://doi.org/10.1016/j.dam.2014.10.024)

[thumbnail of Collins-Kitaev-Lozin-DAM-2014-New-results-on-word-representable-graphs]
Preview
PDF. Filename: Collins_Kitaev_Lozin_DAM_2014_New_results_on_word_representable_graphs.pdf
Accepted Author Manuscript

Download (312kB)| Preview

Abstract

A graph G=(V,E)G=(V,E) is word-representable if there exists a word ww over the alphabet VV such that letters xx and yy alternate in ww if and only if (x,y)∈E(x,y)∈E for each x≠yx≠y. The set of word-representable graphs generalizes several important and well-studied graph families, such as circle graphs, comparability graphs, 3-colorable graphs, graphs of vertex degree at most 3, etc. By answering an open question from Halldórsson et al. (2011), in the present paper we show that not all graphs of vertex degree at most 4 are word-representable. Combining this result with some previously known facts, we derive that the number of nn-vertex word-representable graphs is View the MathML source2n23+o(n2).

ORCID iDs

Collins, Andrew, Kitaev, Sergey ORCID logoORCID: https://orcid.org/0000-0003-3324-1647 and Lozin, Vadim V.;