𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Onk-ordered Graphs Involved Degree Sum

✍ Scribed by Zhi-quan Hu; Feng Tian

Book ID
106300913
Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2003
Tongue
English
Weight
244 KB
Volume
19
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Onk-ordered Hamiltonian graphs
Onk-ordered Hamiltonian graphs
✍ Kierstead, H. A.; SοΏ½rkοΏ½zy, G. N.; Selkow, S. M. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 101 KB πŸ‘ 1 views

the smallest integer m for which any graph on n vertices with minimum degree at least m is a k-ordered Hamiltonian graph. In this article, answering a question of Ng and Schultz, we determine

Degree conditions for k-ordered hamilton
Degree conditions for k-ordered hamiltonian graphs
✍ Ralph J. Faudree; Ronald. J. Gould; Alexandr V. Kostochka; Linda Lesniak; Ingo S πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 113 KB πŸ‘ 1 views

## Abstract For a positive integer __k__, a graph __G__ is __k‐ordered hamiltonian__ if for every ordered sequence of __k__ vertices there is a hamiltonian cycle that encounters the vertices of the sequence in the given order. It is shown that if __G__ is a graph of order __n__ with 3 ≀ __k__ ≀ __n