✦ LIBER ✦

Hamiltonian cycles and dominating cycles passing through a linear forest

✍ Scribed by Kenta Ozeki; Tomoki Yamashita

Book ID: 108114015
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 599 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.02.031

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian cycles passing through linea

Hamiltonian cycles passing through linear forests in -ary -cubes

✍ Shiying Wang; Yuxing Yang; Jing Li; Shangwei Lin 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 456 KB

Long Cycles through a Linear Forest

✍ Zhiquan Hu; Feng Tian; Bing Wei 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 141 KB

For a graph G and an integer k 1, let The main result of this paper is as follows. Let k 3, m 0, and 0 s k&3. Let G be a (m+k&1)-connected graph and let F be a subgraph of G with |E(F )| =m and This generalizes three related results known previously.

Covering a graph with cycles passing thr

Covering a graph with cycles passing through given edges

✍ Wang, Hong 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB 👁 2 views

We propose a conjecture: for each integer k ≥ 2, there exists N (k) such that if G is a graph of order n ≥ N (k) and d(x) + d(y) ≥ n + 2k -2 for each pair of nonadjacent vertices x and y of G, then for any k independent edges e 1 , . . . , e k of G, there exist If this conjecture is true, the condi

Long cycles passing through a specified

Long cycles passing through a specified path in a graph

✍ Hirohata, Kazuhide 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB 👁 2 views

## For a graph G and an integer an independent set of vertices in G}. Enomoto proved the following theorem. Let s ≥ 1 and let G be a (s + 2)-connected graph. Then G has a cycle of length ≥ min{|V (G)|, σ 2 (G) -s} passing through any path of length s. We generalize this result as follows. Let k ≥

Long cycles passing through a specified

Long cycles passing through a specified edge in a 3-connected graph

✍ Enomoto, Hikoe; Hirohata, Kazuhide; Ota, Katsuhiro 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB 👁 2 views

We prove the following theorem: For a connected noncomplete graph Then through each edge of G there passes a cycle of length ≥ min{|V (G)|, τ(G) -1}.

A fault-free Hamiltonian cycle passing t

A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges

✍ Wen-Qing Wang; Xie-Bin Chen 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 166 KB