𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dominating sets and hamiltonicity inK1,3-free graphs

✍ Scribed by A. A. Ageev

Publisher
SP MAIK Nauka/Interperiodica
Year
1994
Tongue
English
Weight
271 KB
Volume
35
Category
Article
ISSN
0037-4466

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Independence and hamiltonicity in 3-domi
Independence and hamiltonicity in 3-domination-critical graphs
✍ Favaron, Odile; Tian, Feng; Zhang, Lei πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 144 KB πŸ‘ 3 views

Let Ξ΄, Ξ³, i and Ξ± be respectively the minimum degree, the domination number, the independent domination number and the independence number of a graph G. The graph G is 3-Ξ³-critical if Ξ³ = 3 and the addition of any edge decreases Ξ³ by 1. It was conjectured that any connected 3-Ξ³-critical graph satisf

Hamiltonicity for K1, r-free graphs
Hamiltonicity for K1, r-free graphs
✍ Guantao Chen; R. H. Schelp πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 719 KB

## 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__

Hamiltonicity and Minimum Degree in 3-co
Hamiltonicity and Minimum Degree in 3-connected Claw-Free Graphs
✍ Odile Favaron; Pierre Fraisse πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 112 KB

Using Ryja c ek's closure, we prove that any 3-connected claw-free graph of order & and minimum degree $ &+38 10 is hamiltonian. This improves a theorem of Kuipers and Veldman who got the same result with the stronger hypotheses $ &+29 8 and & sufficiently large and nearly proves their conjecture sa