✦ LIBER ✦

Neighborhood conditions for graphs with induced claws

✍ Scribed by Annette Schelten; Uwe Schelten

Book ID: 104114135
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 505 KB
Volume: 191
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00105-8

No coin nor oath required. For personal study only.

✦ Synopsis

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. All rights reserved

📜 SIMILAR VOLUMES

Degree with Neighborhood Conditions and

Degree with Neighborhood Conditions and Highly Hamiltonian Graphs

✍ Zhao Kewen; Yue Lin; Ping Zhang 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 247 KB

Claw Conditions for Heavy Cycles in Weig

Claw Conditions for Heavy Cycles in Weighted Graphs

✍ Jun Fujisawa 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 370 KB

Neighborhood Union Conditions for Hamilt

Neighborhood Union Conditions for Hamiltonicity ofP3-Dominated Graphs

✍ Ma, Xiaoling; Vumar, Elkin 📂 Article 📅 2013 🏛 Springer Japan 🌐 English ⚖ 233 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

A new neighborhood condition for graphs

A new neighborhood condition for graphs to be fractional -deleted graphs

✍ Sizhong Zhou 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 211 KB

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