连通、几乎局部连通无爪图是完全圈可扩的

王江鲁

系统工程理论与实践 ›› 1999, Vol. 19 ›› Issue (11) : 121-123.

PDF(121 KB)
PDF(121 KB)
系统工程理论与实践 ›› 1999, Vol. 19 ›› Issue (11) : 121-123. DOI: 10.12011/1000-6788(1999)11-121
论文

连通、几乎局部连通无爪图是完全圈可扩的

    王江鲁
作者信息 +

Every Connected, Almost Locally Connected K(1,3)-Free Graph Is Fully Cycle Extendable

    Jiang Lu WANG
Author information +
文章历史 +

摘要

设G是一个图,B = {v ∈V(G)|〈N(v)〉不连通}.如果B是独立集,并且v ∈B,u ∈V(G), 使〈N(u) ∪{u}〉连通,则称G是几乎局部连通图.本文证明:连通、几乎局部连通无爪图是完全圈可扩的.

Abstract

A graph $G$ is almost locally connected if $B={v∈V(G)|〈N(v)〉$is not connected} is an independent set and, for every $v∈B,u∈V(G)$ such that $〈N(u)∪{u}〉is connected. In this paper, it is proved that every connected, almost locally connected $K\-\{1,3\}$\|free graph is fully cycle extendable.

关键词

几乎局部连通图 / 无爪图 / 完全圈可扩图

Key words

almost locally connected / claw-free graph / fully cycle extendable graphs

引用本文

导出引用
王江鲁. 连通、几乎局部连通无爪图是完全圈可扩的. 系统工程理论与实践, 1999, 19(11): 121-123 https://doi.org/10.12011/1000-6788(1999)11-121
Jiang Lu WANG. Every Connected, Almost Locally Connected K(1,3)-Free Graph Is Fully Cycle Extendable. Systems Engineering - Theory & Practice, 1999, 19(11): 121-123 https://doi.org/10.12011/1000-6788(1999)11-121
PDF(121 KB)

346

Accesses

0

Citation

Detail

段落导航
相关文章

/