Abstract
AbstractThe notion of a k-11-representable graph was introduced by Jeff Remmel in 2017 and studied by Cheon et al. in 2019 as a natural extension of the extensively studied notion of word-representable graphs, which are precisely 0-11-representable graphs. A graph G is k-11-representable if it can be represented by a word w such that for any edge (resp., non-edge) xy in G the subsequence of w formed by x and y contains at most k (resp., at least $$k+1$$
k
+
1
) pairs of consecutive equal letters. A remarkable result of Cheon at al. is that any graph is 2-11-representable, while it is unknown whether every graph is 1-11-representable. Cheon et al. showed that the class of 1-11-representable graphs is strictly larger than that of word-representable graphs, and they introduced a useful toolbox to study 1-11-representable graphs. In this paper, we introduce new tools for studying 1-11-representation of graphs. We apply them for establishing 1-11-representation of Chvátal graph, Mycielski graph, split graphs, and graphs whose vertices can be partitioned into a comparability graph and an independent set.
Publisher
Springer Science and Business Media LLC
Reference22 articles.
1. Bouchet, A.: Caractérisation des symboles croisés de genre nul. C. R. Acad. Sci. Paris 274, 724–727 (1972)
2. Bouchet, A.: Circle graph obstructions. J. Combin. Theory, Ser. B 60(1), 107–144 (1994)
3. Chen, H.Z.Q., Kitaev, S., Saito, A.: Representing split graphs by words. Discuss. Math. Graph Theory 42, 1263 (2022). (Article ID: 4314)
4. Cheon, G.-S., Kim, J., Kim, M., Kitaev, S., Pyatkin, A.: On $$k$$-11-representable graphs. J. Combin. 10(3), 491–513 (2019)
5. Chvátal, V.: The smallest triangle-free 4-chromatic 4-regular graph. J. Combin. Theory 9(1), 93–94 (1970)