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

Long Cycles through a Linear Forest

โœ Scribed by Zhiquan Hu; Feng Tian; Bing Wei

Book ID
102584414
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
141 KB
Volume
82
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ 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 ๐Ÿ‘ 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 โ‰ฅ