𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamiltonicity for K1, r-free graphs

✍ Scribed by Guantao Chen; R. H. Schelp

Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
719 KB
Volume
20
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

In this paper, we investigate the Hamiltonicity of K~1,r~‐free graphs with some degree conditions. In particular, let G be a k‐connected grph of order n≧3 which is K~1,4~‐free. If magnified image for every independent set {v~0~, v~1~, …, v~k~} then G is hamiltonian. We use an upper bound for the independence number of K~1,r~‐free graphs to extent the above result to K~1,r~‐free graphs. Hamiltonian connected and, more generally, q‐edge hamiltonian properties are studied here as well. © 1995 John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

Maximal K3's and Hamiltonicity of 4-conn
Maximal K3's and Hamiltonicity of 4-connected claw-free graphs
✍ Jun Fujisawa; Katsuhiro Ota 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB 👁 1 views

## Abstract Let __cl__(__G__) denote Ryjáček's closure of a claw‐free graph __G__. In this article, we prove the following result. Let __G__ be a 4‐connected claw‐free graph. Assume that __G__[__N__~__G__~(__T__)] is cyclically 3‐connected if __T__ is a maximal __K__~3~ in __G__ which is also maxim

Toughness and hamiltonicity in almost cl
Toughness and hamiltonicity in almost claw-free graphs
✍ Broersma, H.J.; Ryj�?ek, Z.; Schiermeyer, I. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB 👁 3 views

Some known results on claw-free (Kl,3-free) graphs are generalized to the larger class of almost claw-free graphs which were introduced by RyjaEek. In particular, w e show that a 2-connected almost claw-free graph is I-tough, and that a 2-connected almost claw-free graph on n vertices is hamiltonian

Regular factors in K1,n free graphs
Regular factors in K1,n free graphs
✍ Yoshimi Egawa; Katsuhiro Ota 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 280 KB

## Abstract A graph is said to be __K__~1,__n__~‐free, if it contains no __K__~1,__n__~ as an induced subgraph. We prove that for __n__ ⩾ 3 and __r__ ⩾ __n__ −1, if __G__ is a __K__~1,__n__~‐free graph with minimum degree at least (__n__^2^/4(__n__ −1))__r__ + (3__n__ −6)/2 + (__n__ −1)/4__r__, the

On the independence number in K1, r+1-fr
On the independence number in K1, r+1-free graphs
✍ Zdeněk Ryjáček; Ingo Schiermeyer 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 353 KB

In this paper we use the degree sequence, order, size and vertex connectivity of a K 1,,+ 1 -free graph or of an almost claw-free graph to obtain several upper bounds on its independence number. We also discuss the sharpness of these results.