Graph G on n vertices is said to be pancyclic if it contains cycles ofn all lengths k for k is an element of{3, ..., n}. A vertex v is ann element of V (G) is called super-heavy if the number of its neighboursn in G is at least (n + 1)/2. The complete bipartite graph K-1,(3) isn called a claw.For a given graph H we say that G is H-c(1)-heavy if forn every induced subgraph K of G isomorphic to H and every maximal clique Cn in K there is a super-heavy vertex in every non-trivial compon
展开▼
