Standard

Word-Representable Graphs : a Survey. / Kitaev, S. V.; Pyatkin, A. V.

в: Journal of Applied and Industrial Mathematics, Том 12, № 2, 01.04.2018, стр. 278-296.

Результаты исследований: Научные публикации в периодических изданияхстатьяРецензирование

Harvard

Kitaev, SV & Pyatkin, AV 2018, 'Word-Representable Graphs: a Survey', Journal of Applied and Industrial Mathematics, Том. 12, № 2, стр. 278-296. https://doi.org/10.1134/S1990478918020084

APA

Kitaev, S. V., & Pyatkin, A. V. (2018). Word-Representable Graphs: a Survey. Journal of Applied and Industrial Mathematics, 12(2), 278-296. https://doi.org/10.1134/S1990478918020084

Vancouver

Kitaev SV, Pyatkin AV. Word-Representable Graphs: a Survey. Journal of Applied and Industrial Mathematics. 2018 апр. 1;12(2):278-296. doi: 10.1134/S1990478918020084

Author

Kitaev, S. V. ; Pyatkin, A. V. / Word-Representable Graphs : a Survey. в: Journal of Applied and Industrial Mathematics. 2018 ; Том 12, № 2. стр. 278-296.

BibTeX

@article{a53d5f34e0a54087bdde6ae63750e08f,
title = "Word-Representable Graphs: a Survey",
abstract = "Letters x and y alternate in a word w if after deleting all letters but x and y in w we get either a word xyxy.. or a word yxyx.. (each of these words can be of odd or even length). A graph G = (V,E) is word-representable if there is a finite word w over an alphabet V such that the letters x and y alternate in w if and only if xy ∈ E. The word-representable graphs include many important graph classes, in particular, circle graphs, 3-colorable graphs and comparability graphs. In this paper we present the full survey of the available results on the theory of word-representable graphs and the most recent achievements in this field.",
keywords = "orientation, pattern, representation of graphs, word",
author = "Kitaev, {S. V.} and Pyatkin, {A. V.}",
year = "2018",
month = apr,
day = "1",
doi = "10.1134/S1990478918020084",
language = "English",
volume = "12",
pages = "278--296",
journal = "Journal of Applied and Industrial Mathematics",
issn = "1990-4789",
publisher = "Maik Nauka-Interperiodica Publishing",
number = "2",

}

RIS

TY - JOUR

T1 - Word-Representable Graphs

T2 - a Survey

AU - Kitaev, S. V.

AU - Pyatkin, A. V.

PY - 2018/4/1

Y1 - 2018/4/1

N2 - Letters x and y alternate in a word w if after deleting all letters but x and y in w we get either a word xyxy.. or a word yxyx.. (each of these words can be of odd or even length). A graph G = (V,E) is word-representable if there is a finite word w over an alphabet V such that the letters x and y alternate in w if and only if xy ∈ E. The word-representable graphs include many important graph classes, in particular, circle graphs, 3-colorable graphs and comparability graphs. In this paper we present the full survey of the available results on the theory of word-representable graphs and the most recent achievements in this field.

AB - Letters x and y alternate in a word w if after deleting all letters but x and y in w we get either a word xyxy.. or a word yxyx.. (each of these words can be of odd or even length). A graph G = (V,E) is word-representable if there is a finite word w over an alphabet V such that the letters x and y alternate in w if and only if xy ∈ E. The word-representable graphs include many important graph classes, in particular, circle graphs, 3-colorable graphs and comparability graphs. In this paper we present the full survey of the available results on the theory of word-representable graphs and the most recent achievements in this field.

KW - orientation

KW - pattern

KW - representation of graphs

KW - word

UR - http://www.scopus.com/inward/record.url?scp=85047875062&partnerID=8YFLogxK

U2 - 10.1134/S1990478918020084

DO - 10.1134/S1990478918020084

M3 - Article

AN - SCOPUS:85047875062

VL - 12

SP - 278

EP - 296

JO - Journal of Applied and Industrial Mathematics

JF - Journal of Applied and Industrial Mathematics

SN - 1990-4789

IS - 2

ER -

ID: 13755447