OFFSET
1,3
COMMENTS
A graph is weakly pancyclic if it contains cycles of all lengths between its girth and its circumference. Acyclic graphs are considered to be weakly pancyclic. The concept of weak pancyclicity was introduced by Brandt, Faudree, and Goddard (1998).
LINKS
Stephan Brandt, Ralph Faudree, and Wayne Goddard, Weakly pancyclic graphs, Journal of Graph Theory 27 (1998), 141-176.
FORMULA
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Pontus von Brömssen, May 29 2023
STATUS
approved