Year: 2015
Type: article
Abstract: Let G be a graph on n vertices and let H be a given graph. We say that G is pancyclic, if it contains cycles of all lengths from 3 up to n, and that it is H-f 1 -heavy, if for every induced subgraph K of G isomorphic to H and every two vertices
DOI: 10.7151/dmgt.1840
Author: Wojciech Wideł
Institution: AGH University of Krakow
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2562091529