J4
• 论文 • 上一篇 下一篇
高云澍，颜谨
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
GAO Yun-peng,YAN Jin
Received:
Revised:
Online:
Published:
Contact:
摘要： 在无爪图G中,设σ2(G)表示不相邻顶点度和的最小值. 令|V(G)|=n=∑ki=1ai,ai6,1ik,并且σ2(G)n+k-1,证明了对于图G中任意的k个顶点v1,v2,…vk, 都存在点不相交的路P1,P2,…Pk，使得对于1ik，都有|V(Pi)|=ai并且vi是路Pi的一个端点.
关键词: 图的剖分, 路因子, 点不相交的路
Abstract: For a clawfree graph G, let σ2(G) denote the minimum degree sum of a pair of nonadjacent vertices. Let |V(G)|=n=∑ki=1ai with ai6,1ik, and suppose that σ2(G)n+k-1. It is proved that for any k vertices v1,v2,…vk in G, there exist vertexdisjoint paths P1,P2,…Pk such that |V(Pi)|=ai and vi is a endvertex of Pi for 1ik.
Key words: vertexdisjoint paths , pathfactors, graph partition
高云澍,颜谨 . 无爪图中具有指定长度的路因子[J]. J4, 2006, 41(5): 51-54 .
GAO Yun-peng,YAN Jin . Pathfactors with prescribed length in clawfree graphs[J]. J4, 2006, 41(5): 51-54 .
推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://lxbwk.njournal.sdu.edu.cn/CN/
https://lxbwk.njournal.sdu.edu.cn/CN/Y2006/V41/I5/51
Cited
