Fully Circle Extendability of Triangularly Connected (K_(1,4);2)-Graphs
Wang Jiang-lu · Shandong kexue · 2007
A graph G is triangularly connected if for every pair of edges e1,e2∈E(G),G has a sequence of 3-cycles C1,C2,…,Cl,which meet the condition of e1∈C1,e2∈Cl and E(Ci)∩E(Ci+1)≠(1≤i≤l-1).This paper proves that every triangularly connected(K1,4;2)-graph with independent claw centers and at least three vertices and without any isolated vertex is full circle and extendable.