Potentially 3 C l Graphic Sequences
Jiong-Sheng Li · 1999
In this paper, we give a lower bound of σ( 3C l,n), the smallest even integer m such that every n term graphic sequence π with term sum σ(π)m has a realization containing a cycle of length r for each r, 3rl, and determind the values of σ( 3C l,n) for 4l6 and nl. This is a variation of the classical theorem due to Woodall.