In a graph G,a induced subgraph isomorphic to K 1,3 is called a claw of G.The vertex with degree 3 in a claw is called a claw centre.The set of claw centres of G is denoted by B. In this paper, we prove that if G is connected, locally connected graph on at least three vertices such that the set of claw centres B is independent, and if G-B is locally connected, then G is fully cycle extendable.
Wang Jianglu . , {{custom_author.name_en}}.
Extending Cycle in Graphs with Independent Claw Centres. Systems Engineering - Theory & Practice, 1997, 17(9): 69-71 https://doi.org/10.12011/1000-6788(1997)9-69