An embedding technique in the study of word-representabiliy of graphs
arxiv(2023)
摘要
Word-representable graphs, which are the same as semi-transitively orientable
graphs, generalize several fundamental classes of graphs. In this paper we
propose a novel approach to study word-representability of graphs using a
technique of homomorphisms. As a proof of concept, we apply our method to show
word-representability of the simplified graph of overlapping permutations that
we introduce in this paper. For another application, we obtain results on
word-representability of certain subgraphs of simplified de Bruijn graphs that
were introduced recently by Petyuk and studied in the context of
word-representability.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要