摘要
如果一个图的任意s阶导出子图中至少含有t条边,则称这个图为[s,t]-图.用G3表示任意3阶图,证明了3-连通[5,3]-图是Hamilton图或者同构于-K4∨G3.
A graph G is called [s,t]-graph if there are at least t edges in any induced subgraphs with order s of G. We use G3 to denote any graph with order 3. In this paper, we prove that every 3-connected [5,3]-graph G is Hamiltonian or G≌K^-4 V G3.
出处
《内蒙古师范大学学报（自然科学汉文版）》
CAS
2005年第3期288-289,共2页
Journal of Inner Mongolia Normal University(Natural Science Edition)
基金
山东省教委科技计划项目(J01P01)
