✦ LIBER ✦

Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs

✍ Scribed by Jinfeng Feng

Publisher: Springer
Year: 2008
Tongue: English
Weight: 186 KB
Volume: 69
Category: Article
ISSN: 0340-9422
DOI: 10.1007/s00186-008-0263-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian cycles in 2-connected claw-f

Hamiltonian cycles in 2-connected claw-free-graphs

✍ Hao Li 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB 👁 2 views

## Abstract M. Matthews and D. Sumner have proved that of __G__ is a 2‐connected claw‐free graph of order __n__ such that δ ≧ (__n__ − 2)/3, then __G__ is hamiltonian. We prove that the bound for the minimum degree δ can be reduced to __n__/4 under the additional condition that __G__ is not in __F_

Distance-Dominating Cycles in Quasi Claw

Distance-Dominating Cycles in Quasi Claw-Free Graphs

✍ Chuanping Chen; Amel Harkat-Benhamdine; Hao Li 📂 Article 📅 1999 🏛 Springer Japan 🌐 English ⚖ 90 KB

Hamiltonian Cycles in Almost Claw-Free G

Hamiltonian Cycles in Almost Claw-Free Graphs

✍ MingChu Li 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 209 KB

Hamiltonian cycles in 3-connected claw-f

Hamiltonian cycles in 3-connected claw-free graphs

✍ MingChu Li 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 437 KB 👁 2 views

Hamilton cycles in claw-free graphs

✍ Cun-Quan Zhang 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 299 KB 👁 2 views

Dominating cycles in bipartite biclaw-fr

Dominating cycles in bipartite biclaw-free graphs

✍ Daniel Barraez; Evelyne Flandrin; Hao Li; Oscar Ordaz 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 354 KB

Flandrin et ai. (to appear) define a simple bipartite graph to be biclaw-free if it contains no induced subgraph isomorphic to H, where H could be obtained from two copies of K1.3 by adding an edge joining the two vertices of degree 3. They have shown that if G is a bipartite, balanced, biclaw-free