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.
机构:
Fac Informat Studies, Novo Mesto 8000, Slovenia
Inst Math Phys & Mech, Ljubljana 1000, SloveniaFac Informat Studies, Novo Mesto 8000, Slovenia
Luzar, Borut
Petrusevski, Mirko
论文数: 0引用数: 0
h-index: 0
机构:
Fac Mech Engn, Dept Math & Informat, Skopje, MacedoniaFac Informat Studies, Novo Mesto 8000, Slovenia
Petrusevski, Mirko
Skrekovski, Riste
论文数: 0引用数: 0
h-index: 0
机构:
Fac Informat Studies, Novo Mesto 8000, Slovenia
Inst Math Phys & Mech, Ljubljana 1000, Slovenia
Univ Primorska, FAMNIT, Koper 6000, SloveniaFac Informat Studies, Novo Mesto 8000, Slovenia