✦ LIBER ✦

Covering a graph with cycles passing through given edges

✍ Scribed by Wang, Hong

Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 91 KB
Volume: 26
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199710)26:2<105::aid-jgt5>3.0.co;2-w

No coin nor oath required. For personal study only.

✦ Synopsis

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 condition on the degrees of G is sharp. We prove this conjecture for the case k = 2 in the paper.

📜 SIMILAR VOLUMES

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 👁 1 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}.