On k-11-representable graphs

  title={On k-11-representable graphs},
  author={Gi-Sang Cheon and Jinha Kim and Minki Kim and S. Kitaev and A. Pyatkin},
  journal={arXiv: Combinatorics},
Distinct letters $x$ and $y$ alternate in a word $w$ if after deleting in $w$ all letters but the copies of $x$ and $y$ we either obtain a word of the form $xyxy\cdots$ (of even or odd length) or a word of the form $yxyx\cdots$ (of even or odd length). A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $xy$ is an edge in $E$. Thus, edges of $G$ are defined by avoiding the consecutive pattern 11… Expand
1 Citations

Figures from this paper

Enumeration and extensions of word-representants


Existence of u-Representation of Graphs
  • S. Kitaev
  • Mathematics, Computer Science
  • J. Graph Theory
  • 2017
A Comprehensive Introduction to the Theory of Word-Representable Graphs
  • S. Kitaev
  • Computer Science, Mathematics
  • DLT
  • 2017
Word Problem of the Perkins Semigroup via Directed Acyclic Graphs
Semi-transitive orientations and word-representable graphs
On Representable Graphs
Words and Graphs
  • S. Kitaev, V. Lozin
  • Computer Science
  • Monographs in Theoretical Computer Science. An EATCS Series
  • 2015
Coloring circle graphs
  • Jakub Cerný
  • Mathematics, Computer Science
  • Electron. Notes Discret. Math.
  • 2007
The On-Line Encyclopedia of Integer Sequences
  • N. Sloane
  • Mathematics, Computer Science
  • Electron. J. Comb.
  • 1994
ω-Perfect graphs
On a New Class of Intersection Graphs