✦ LIBER ✦

Degree with Neighborhood Conditions and Highly Hamiltonian Graphs

✍ Scribed by Zhao Kewen; Yue Lin; Ping Zhang

Book ID: 106334892
Publisher: Springer Netherlands
Year: 2008
Tongue: English
Weight: 247 KB
Volume: 109
Category: Article
ISSN: 0167-8019
DOI: 10.1007/s10440-008-9328-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian graphs with neighborhood int

Hamiltonian graphs with neighborhood intersections

✍ G. Chen; R. H. Schelp 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 577 KB

## Abstract In this paper, __k__ + 1 real numbers __c__~1~, __c__~2~, ⃛, __c__~__k__+1~ are found such that the following condition is sufficient for a __k__‐connected graph of order __n__ to be hamiltonian: for each independent vertex set of __k__ + 1 vertices in __G__. magnified image where S~i~

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 new neighborhood union condition for H

A new neighborhood union condition for Hamiltonian graphs

✍ Wei Bing; Zhu Yongjin 📂 Article 📅 1997 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 293 KB

An implicit degree condition for hamilto

An implicit degree condition for hamiltonian graphs

✍ Hao Li; Wantao Ning; Junqing Cai 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 216 KB

Hamiltonian graphs involving neighborhoo

Hamiltonian graphs involving neighborhood unions

✍ Guantao Chen; Warren E. Shreve; Bing Wei 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

## Abstract Dirac proved that a graph __G__ is hamiltonian if the minimum degree $\delta(G) \geq n/2$, where __n__ is the order of __G__. Let __G__ be a graph and $A \subseteq V(G)$. The neighborhood of __A__ is $N(A)=\{ b: ab \in E(G)$ for some $a \in A\}$. For any positive integer __k__, we show

Hamiltonian properties of graphs with la

Hamiltonian properties of graphs with large neighborhood unions

✍ Douglas Bauer; Genghua Fan; Henk Jan Veldman 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 768 KB

Bauer, D., G. Fan and H.J. Veldman, Hamiltonian properties of graphs with large neighborhood unions, Discrete Mathematics 96 (1991) 33-49. Let G be a graph of order n, a k =min{~ki=ld(vi): {V 1 ..... Vn} is an independent set of vertices in G}, NC=min{IN(u) 13N(v)l:uv~E(G)} and NC2=min{IN(u) t3 wh