✦ LIBER ✦

Long paths through four vertices in a 2-connected graph

✍ Scribed by Barovich, Mark V.

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 252 KB
Volume: 33
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(200002)33:2<55::aid-jgt1>3.0.co;2-s

No coin nor oath required. For personal study only.

✦ Synopsis

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

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