THE BINDING NUMBER OF A GRAPH AND ITS TRIANGLE |
| |
作者姓名: | 施容华 |
| |
作者单位: | Qinghai Normal |
| |
摘 要: | In this paper we prove the following conjecture of Woodall:if bind(G)≥3/2,then Gcontains a triangle.Moreover,we also prove that if bind(G)≥3/2,then each vertex is contained ina 4-cycle,each edge is contained in a 5-cycle when V(G)≥11,and there exists a 6-cycle in G.
|
本文献已被 CNKI 等数据库收录! |
|