期刊文献+

A new result on local forbidden graph and hamiltonicity

A new result on local forbidden graph and hamiltonicity
原文传递
导出
摘要 In this note, we denote by G a graph with order n, by V and E the vertex set andedge set of G, respectively. V<sub>0</sub>={v∈V|d(v)≥n/2}, V<sub>0</sub>=V\V<sub>0</sub>. Let H be a subgraph ofG. For simplicity, we also use H to denote the vertex set of it. For a∈V S, TV,
出处 《Chinese Science Bulletin》 SCIE EI CAS 1996年第2期93-99,共7页
关键词 [K1 3 F]-free GRAPH HAMILTON GRAPH VD-cycle. {K-1,K-3, F)-free graph Hamilton graph VD-cycle
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部