Every Connected, Almost Locally Connected K_(1,3)-Free Graph Is Fully Cycle Extendable
Wang Jiang · Systems Engineering - Theory & Practice · 1999
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.