期刊文献+

Hamilton Properties of Domination Critical Graphs

Hamilton Properties of Domination Critical Graphs
下载PDF
导出
摘要 Ewa·Wojcicka [1] has proved that the connected 3 γ critical graphs has a H path and has put forward to such a conjecture: Connected 3 γ critical graphs without endpoints are H graphs. In this paper,we prove that if G is a connected 3 γ critical graph without endpoints and has a H paht ap →a such that d(a,b)=3, then G is a H graph. The result partially solves Ewa. Wojcickas conjecture.
机构地区 Zhoukou Normal
出处 《Chinese Quarterly Journal of Mathematics》 CSCD 1998年第1期14-21, ,共8页 数学季刊(英文版)
关键词 critical graph H path H cycle H graph 控制临界图 HAmilton图 HAmilton圈
  • 相关文献

参考文献1

  • 1Ren Shijun,南京大学学报,1991年,27卷,7页

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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