𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Degree Sum Condition for k-ordered Hamiltonian Connected Graphs

✍ Scribed by Nicholson, Emlee W.; Wei, Bing

Book ID
121584704
Publisher
Springer Japan
Year
2013
Tongue
English
Weight
312 KB
Volume
31
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A degree sum condition for longest cycle
A degree sum condition for longest cycles in 3-connected graphs
✍ Tomoki Yamashita πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 110 KB πŸ‘ 1 views

## Abstract For a graph __G__, we denote by __d__~__G__~(__x__) and ΞΊ(__G__) the degree of a vertex __x__ in __G__ and the connectivity of __G__, respectively. In this article, we show that if __G__ is a 3‐connected graph of order __n__ such that __d__~__G__~(__x__) + __d__~__G__~(__y__) + __d__~__

A necessary and sufficient condition for
A necessary and sufficient condition for connected, locally k-connected k1,3-free graphs to be k-hamiltonian
✍ Zhou Huai-Lu πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 272 KB πŸ‘ 2 views

We prove the following conjecture of Broersma and Veldman: A connected, locally k-connected K,,-free graph is k-hamiltonian if and only if it is (k + 2)-connected ( k L 1). We use [ 11 for basic terminology and notation, and consider simple graphs only. Let G be a graph. By V(G) and E(G) we denote,