✦ LIBER ✦

Disjoint Hamiltonian cycles in fan 2k-type graphs

✍ Scribed by Zhou Sanming

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 231 KB
Volume: 17
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190170603

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

It is conjectured that a 2(k + 1)‐connected graph of order p contains k + 1 pairwise disjoint Hamiltonian cycles if no two of its vertices that have degree less than 1/2 + 2__k__ are distance two apart. This is proved in detail for k = 1. Similar arguments establish the conjecture for k = 2. © 1993 John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

Edge-disjoint Hamiltonian cycles in hype

Edge-disjoint Hamiltonian cycles in hypertournaments

✍ Vojislav Petrovic; Carsten Thomassen 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB

## Abstract We introduce a method for reducing __k__‐tournament problems, for __k__ ≥ 3, to ordinary tournaments, that is, 2‐tournaments. It is applied to show that a __k__‐tournament on __n__ ≥ k + 1 + 24__d__ vertices (when __k__ ≥ 4) or on __n__ ≥ 30__d__ + 2 vertices (when __k__ = 3) has __d__

Edge disjoint cycles in graphs

✍ Li Hao 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 419 KB

Disjoint cycles in star-free graphs

✍ Markus, Lisa R.; Snevily, Hunter S. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 322 KB 👁 3 views

A graph is claw-free if it does not contain K l , 3 as an induced subgraph. It is Kl,,-free if it does not contain K l , r as an induced subgraph. We show that if a graph is Kl,,-free ( r 2 4), only p + 2r -1 edges are needed to insure that G has t w o disjoint cycles. As an easy consequence w e ge

Edge disjoint Hamilton cycles in graphs

✍ Guojun Li 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 2 views

Disjoint cycles with chords in graphs

✍ Ch. Sobhan Babu; Ajit A. Diwan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

## Abstract Let $n\_1,n\_2,\ldots,n\_k$ be integers, $n=\sum n\_i$, $n\_i\ge 3$, and let for each $1\le i\le k$, $H\_i$ be a cycle or a tree on $n\_i$ vertices. We prove that every graph __G__ of order at least __n__ with $\sigma\_2(G) \ge 2( n-k) -1$ contains __k__ vertex disjoint subgraphs $H\_1'

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_