The Library
New results on word-representable graphs
Tools
Collins, Andrew, Kitaev, Sergey and Lozin, Vadim V. (2017) New results on word-representable graphs. Discrete Applied Mathematics, 216 . pp. 136-141. doi:10.1016/j.dam.2014.10.024 ISSN 0166-218X.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1016/j.dam.2014.10.024
Abstract
A graph is word-representable if there exists a word over the alphabet such that letters and alternate in if and only if for each . 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 -vertex word-representable graphs is .
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
Journal or Publication Title: | Discrete Applied Mathematics | ||||
Publisher: | Elsevier Science Ltd. | ||||
ISSN: | 0166-218X | ||||
Official Date: | 10 January 2017 | ||||
Dates: |
|
||||
Volume: | 216 | ||||
Page Range: | pp. 136-141 | ||||
DOI: | 10.1016/j.dam.2014.10.024 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |