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.
Jiang Lu WANG. , {{custom_author.name_en}}.
Every Connected, Almost Locally Connected -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