New results on word-representable graphs

Andrew Collins, Sergey Kitaev, Vadim V. Lozin

Research output: Contribution to journalArticle

5 Citations (Scopus)
54 Downloads (Pure)

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).
Original languageEnglish
Pages (from-to)136-141
Number of pages6
JournalDiscrete Applied Mathematics
Volume216
Issue numberPart 1
Early online date20 Nov 2014
DOIs
Publication statusPublished - 10 Jan 2017

Fingerprint

Graph in graph theory
Vertex Degree
Circle Graph
Comparability Graph
Alternate
If and only if
Generalise
Vertex of a graph

Keywords

  • semi-transitive orientation
  • speed of hereditary properties
  • hereditary property of graphs

Cite this

Collins, Andrew ; Kitaev, Sergey ; Lozin, Vadim V. / New results on word-representable graphs. In: Discrete Applied Mathematics. 2017 ; Vol. 216, No. Part 1. pp. 136-141.
@article{82f998266d85464aa9ef18647351029c,
title = "New results on word-representable graphs",
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{\'o}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).",
keywords = "semi-transitive orientation, speed of hereditary properties, hereditary property of graphs",
author = "Andrew Collins and Sergey Kitaev and Lozin, {Vadim V.}",
note = "“NOTICE: this is the author’s version of a work that was accepted for publication in Discrete Applied Mathematics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Discrete Applied Mathematics, [VOL 216, Part 1, (20/11/14)] DOI: 10.1016/j.dam.2014.10.024¨",
year = "2017",
month = "1",
day = "10",
doi = "10.1016/j.dam.2014.10.024",
language = "English",
volume = "216",
pages = "136--141",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
number = "Part 1",

}

New results on word-representable graphs. / Collins, Andrew; Kitaev, Sergey; Lozin, Vadim V.

In: Discrete Applied Mathematics, Vol. 216, No. Part 1, 10.01.2017, p. 136-141.

Research output: Contribution to journalArticle

TY - JOUR

T1 - New results on word-representable graphs

AU - Collins, Andrew

AU - Kitaev, Sergey

AU - Lozin, Vadim V.

N1 - “NOTICE: this is the author’s version of a work that was accepted for publication in Discrete Applied Mathematics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Discrete Applied Mathematics, [VOL 216, Part 1, (20/11/14)] DOI: 10.1016/j.dam.2014.10.024¨

PY - 2017/1/10

Y1 - 2017/1/10

N2 - 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).

AB - 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).

KW - semi-transitive orientation

KW - speed of hereditary properties

KW - hereditary property of graphs

U2 - 10.1016/j.dam.2014.10.024

DO - 10.1016/j.dam.2014.10.024

M3 - Article

VL - 216

SP - 136

EP - 141

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - Part 1

ER -