In this paper, we prove that every graph with maximum degree six that can be embedded in a surface of nonnegative characteristic is of Class I if it does not contain a 5- or 6-cycle with a chord, which extends some kn...In this paper, we prove that every graph with maximum degree six that can be embedded in a surface of nonnegative characteristic is of Class I if it does not contain a 5- or 6-cycle with a chord, which extends some known results.展开更多
基金Supported partially by the National Natural Science Foundation of China(11071223)the Zhejiang Natural Science Foundation of China(Z6090150)the Foundation of Zhejiang Educational Committee(Y201226078)
文摘In this paper, we prove that every graph with maximum degree six that can be embedded in a surface of nonnegative characteristic is of Class I if it does not contain a 5- or 6-cycle with a chord, which extends some known results.