JOURNAL BROWSE
Search
Advanced SearchSearch Tips
SUFFICIENT CONDITIONS FOR SOME HAMILTONIAN PROPERTIES AND K-CONNECTIVITY OF GRAPHS
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
SUFFICIENT CONDITIONS FOR SOME HAMILTONIAN PROPERTIES AND K-CONNECTIVITY OF GRAPHS
LI, RAO;
 
 Abstract
For a connected graph G
 Keywords
Hamiltonian property;k-connected graph;
 Language
English
 Cited by
 References
1.
C. Berge, Graphs and Hypergraphs, American Elsevier Publishing Company, 1976.

2.
F. Boesch, The strongest monotone degree condition for n-connectedness of a graph, J. Combin. Theory Ser. B 16 (1974), 162-165. crossref(new window)

3.
J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, Macmillan, London and Elsevier, New York, 1976.

4.
S. Cioabă, Sums of powers of the degrees of a graph, Discrete Math. 306 (2006), 1959-1964. crossref(new window)