𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Global insertion and hamiltonicity in DCT-graphs

✍ Scribed by A. Ainouche; O. Favaron; H. Li

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
708 KB
Volume
184
Category
Article
ISSN
0012-365X

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

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

Hamiltonicity and forbidden subgraphs in
Hamiltonicity and forbidden subgraphs in 4-connected graphs
✍ Florian Pfender πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 121 KB

## Abstract Let __T__ be the line graph of the unique tree __F__ on 8 vertices with degree sequence (3,3,3,1,1,1,1,1), i.e., __T__ is a chain of three triangles. We show that every 4‐connected {__T__, __K__~1,3~}‐free graph has a hamiltonian cycle. Β© 2005 Wiley Periodicals, Inc. J Graph Theory 49:

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