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

A 2-factor with Short Cycles Passing Through Specified Independent Vertices in Graph

โœ Scribed by Jiuying Dong

Book ID
106047721
Publisher
Springer Japan
Year
2008
Tongue
English
Weight
136 KB
Volume
24
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Heavy cycles passing through some specif
Heavy cycles passing through some specified vertices in weighted graphs
โœ Jun Fujisawa; Kiyoshi Yoshimoto; Shenggui Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 111 KB

## Abstract A weighted graph is one in which every edge __e__ is assigned a nonnegative number, called the weight of __e__. The sum of the weights of the edges incident with a vertex ฯ… is called the weighted degree of ฯ…. The weight of a cycle is defined as the sum of the weights of its edges. In th

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

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