共 50 条
Cycles of length 1 modulo 3 in graph
被引:0
|作者:
Lu, M
[1
]
Yu, ZG
[1
]
机构:
[1] Tsing Hua Univ, Dept Math Sci, Beijing 100084, Peoples R China
关键词:
cycle;
modulo;
chord;
D O I:
暂无
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
We prove a conjecture of Saito that if a graph G with delta greater than or equal to 3 has no cycle of length 1 (mod 3), then G has an induced subgraph which is isomorphic to the Petersen graph. The above result strengthened the result by Dean et al. that every 2-connected graph with delta greater than or equal to 3 has a (1 mod 3)-cycle if G is not isomorphic to the Petersen graph. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:329 / 336
页数:8
相关论文