✦ LIBER ✦

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

✍ Scribed by Enomoto, Hikoe; Hirohata, Kazuhide; Ota, Katsuhiro

Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 80 KB
Volume: 24
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199703)24:3<275::aid-jgt9>3.0.co;2-m

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 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 ≥

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 👁 1 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 paths through four vertices in a 2-

Long paths through four vertices in a 2-connected graph

✍ Barovich, Mark V. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB 👁 2 views

Let G be a 2-connected graph, let u and v be distinct vertices in V (G), and let X be a set of at most four vertices lying on a common (u