摘要
本文证明了如果 G 是 2 连通无爪图, G 不是圈,n= | V( G)|≥9, G 的每个导出子图 A都满足φ(a1,a2 ),且 G 中不含同构于 Z+2 的导出子图,则
This paper proves that if “ G ” is a biconnected K 1 3 free graph, “ G ” isn't a cycle, n=|V(G)|≥9 , and each induced subgraph A of “G” satisfies φ(a 1,a 2) . If there is no “ Z + 2 ” as its induced subgraph in “ G”, “G” is a pancyclicity graph.
出处
《工科数学》
1999年第3期64-66,共3页
Journal of Mathematics For Technology