1.School of Management,Beijing University of Chinese Medicine,Beijing,China
Abstract:
Let G be a graph embeddable in a surface of nonnegative characteristic with maximum degree six. In this paper, we prove that if G contains no a vertex v which is contained in all cycles of lengths from 3 to 6, then G is of Class 1.