arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1306.1345cs.DMcs.DSmath.CO
收藏

关于线性秩宽为1的图的一个注记

A Note on Graphs of Linear Rank-Width 1

Binh-Minh Bui-Xuan, Mamadou Moustapha Kanté, Vincent Limouzy

摘要:

本文证明了一个连通图的线性秩宽为1当且仅当它是一个距离遗传图且它的分裂分解树是一条路.一个直接的结果是,我们可以在线性时间内判定一个图的线性秩宽是否至多为1,如果不是,则给出一个障碍.其他直接的结果是线性秩宽为1的图的几个特征。特别地,一个连通图具有线性秩宽1当且仅当它局部等价于一个毛毛虫当且仅当它是一条路的顶点子图[O-juanKwon and Sang-il Oum,Graphs of small rank-width are approximates-minor of graphs of small tree-width,arxiv:1203.3606]当且仅当它不包含co-K_2图、Net图和5-圈图作为顶点子图[Isolde Adler,Arthur M. Farley和Andrzej Proskurowski,线性秩宽度至多为1的障碍,arxiv:1106.2533]。

英文摘要:

We prove that a connected graph has linear rank-width 1 if and only if it is a distance-hereditary graph and its split decomposition tree is a path. An immediate consequence is that one can decide in linear time whether a graph has linear rank-width at most 1, and give an obstruction if not. Other immediate consequences are several characterisations of graphs of linear rank-width 1. In particular a connected graph has linear rank-width 1 if and only if it is locally equivalent to a caterpillar if and only if it is a vertex-minor of a path [O-joung Kwon and Sang-il Oum, Graphs of small rank-width are pivot-minors of graphs of small tree-width, arxiv:1203.3606] if and only if it does not contain the co-K_2 graph, the Net graph and the 5-cycle graph as vertex-minors [Isolde Adler, Arthur M. Farley and Andrzej Proskurowski, Obstructions for linear rank-width at most 1, arxiv:1106.2533].

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑