๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Long Paths Through Specified Vertices In 3-Connected Graphs

โœ Scribed by Toshinori Sakai

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
507 KB
Volume
11
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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

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 โ‰ฅ