期刊论文

中文

华中师范大学学报(自然科学版)

1000-1190

2006

40

3

313-314,319

10.19603/j.cnki.1000-1190.2006.03.003

国家自然科学基金资助项目（10371048）；

本校为第一机构

k-联性是图的一个重要的连通性质.Kawarabayashi证明了对k≠4,5,围长至少为11的2k-连通图是k-联图.本文对该结果进行了改进,证明了对k≥12,围长为9,或7≤k≤11,围长至少为10的2k-连通图是k-联图.

Linkage is one of the most important properties in graph theory. Kawarabayashi has proved that for k≠4,5 every 2k-connected graph with girth at least 11 is k-linked. This paper is to improve the result above, and shows that for any integer k≥12, with girth being 9 or for 7≤k≤11, with girth at least 10, e...