摘要
如果图G的任意s个顶点的导出子图中至少含有t条边,则称图G为[s,t]-图。本文证明:连通、几乎局部连通[4,2]-图中任意一个满足5≤|C|≤|G|的圈是可扩的。
A graph G is a[ s, t]-graph if there are at least t edges in its every included subgraph of s vertices. This paper proves that any cycle C satisfying 5 ≤ ｜ C ｜≤｜ G｜ is extendable in a almost locally connected [ 4,2 ] graph.
出处
《山东科学》
CAS
2011年第1期65-67,共3页
Shandong Science
关键词
[S
T]-图
几乎局部连通图
完全圈可扩
[ s, t ] -graph
almost locally connected graph
full cycle extendable
