Hamilton Properties of Domination Critical Graphs  

作　　者：段广森 王新社 

机构地区：[1]Zhoukou [2]Normal

出　　处：《Chinese Quarterly Journal of Mathematics》1998年第1期14-21, ,共8页数学季刊（英文版）

摘　　要：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.

关 键 词：critical graph H    path H    cycle H    graph 

分 类 号：O157.5[理学—数学]