摘要
设σ（３Ｃｌ，ｎ）是具有下述性质的最小正偶数，每个项和至少为σ（３Ｃｌ，ｎ）的ｎ项可图序列π都有一个实现含有长为３，４，…，ｌ的圈．本文首先给出了σ（３Ｃｌ，ｎ）的下界，并确定了当４ｌ６且ｎｌ时σ（３Ｃｌ，ｎ）的值．
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.
关键词
图
度序列
可图序列
简单图
圈
graph, degree sequence, potentially G graphic sequence
