Representing Graphs via Pattern Avoiding Words

Electronic Journal Of Combinatorics

Miles Jones¹ 

关键词: word-representable graphs;    pattern avoidance;    comparability graphs;    co-interval graphs;    permutation graphs;    grid graphs;    ladder graphs;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

The notion of a word-representable graph has been studied in a series of papers in the literature. 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$

【 授权许可】

Others