科研之友
微信
新浪微博
Facebook
分享链接
摘要
Suppose that F is the set of connected graphs such that a graph G is an element of F if and only if G satisfies both (F1) if X is an edge cut of G with vertical bar X vertical bar <= 3, then there exists a vertex v of degree vertical bar X vertical bar such that X consists of all the edges incident with v in G, and (F2) for every v of degree 3, v lies in a k-cycle of G, where 2 <= k <= 3. In this paper, we show that if G is an element of F and kappa'(G) >= 3, then for every pair of edges e, f is an element of E(G), G has a trail with initial edge e and final edge f which contains all vertices of G. This result extends several former results.
- 出版日期2005-3
- 单位华中师范大学
