✦ LIBER ✦

Neighborhood Union Conditions for Hamiltonicity ofP3-Dominated Graphs

✍ Scribed by Ma, Xiaoling; Vumar, Elkin

Book ID: 121626471
Publisher: Springer Japan
Year: 2013
Tongue: English
Weight: 233 KB
Volume: 30
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-013-1354-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On hamiltonicity ofP3-dominated graphs

✍ H. J. Broersma; E. Vumar 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 165 KB

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

Neighborhood union of independent sets a

Neighborhood union of independent sets and hamiltonicity of claw-free graphs

✍ Xinping Xu 📂 Article 📅 2005 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 257 KB

A sufficient condition for graphs with l

A sufficient condition for graphs with large neighborhood unions to be traceable

✍ Shijun Ren 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 246 KB

We prove that a 2-connected graph G of order p is traceable if (u, v, w, x are distinct vertices of G). In addition, we give a short proof of Lindquester's conjecture.

Neighborhood conditions for graphs with

Neighborhood conditions for graphs with induced claws

✍ Annette Schelten; Uwe Schelten 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 505 KB

K~,4-free graphs with independent claw centers and a certain neighborhood property concerning the endvertices of the induced claws are proved to be pancyclic or Hamiltonian, depending on which of three different properties concerning induced modified claws they meet. (~) 1998 Elsevier Science B.V. A

Neighborhood conditions for balanced ind

Neighborhood conditions for balanced independent sets in bipartite graphs

✍ Denise Amar; Stephan Brandt; Daniel Brito; Oscar Ordaz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 319 KB

Let G be a balanced bipartite graph of order 2n and minimum degree 6(G)>~3. If, for every balanced independent set S of four vertices, IN(S)I >n then G is traceable, the circumference is at least 2n -2 and G contains a 2-factor (with only small order exceptional graphs for the latter statement). If