A Safficient Wndition for N-Factor-Critical Craphs
Zhou Shu · Jiangxi kexue · 2003
It is proved that:Let G be a graph of order p and let u,v∈V(G)satisfying d(u,v)=2 with d(u)+d(v)≥p+n-1,Then G is n_factor_critical graph.And also we obtain some corollaries of this theorem.