Proof of a conjecture of HΓ€ggkvist on cy
β
Kenneth A. Berman
π
Article
π
1983
π
Elsevier Science
π
English
β 196 KB
A graph G of order n is a ck-graph if for every pair of d~tinct, nonadlacenl veJtlces x and y' d(x)+d(y)>~n+k where d(v) denotes the degree of a vertex v In this paper, we prove the