𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Long cycles through specified vertices in a graph

✍ Scribed by Akira Saito

Book ID
107884281
Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
650 KB
Volume
47
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Cycles through specified vertices
Cycles through specified vertices
✍ BΓ©la BollobΓ‘s; Graham Brightwell πŸ“‚ Article πŸ“… 1993 πŸ› Springer-Verlag 🌐 English βš– 552 KB
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 β‰₯

Edge disjoint cycles through specified v
Edge disjoint cycles through specified vertices
✍ Luis Goddyn; Ladislav Stacho πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 158 KB

## Abstract We give a sufficient condition for a simple graph __G__ to have __k__ pairwise edge‐disjoint cycles, each of which contains a prescribed set __W__ of vertices. The condition is that the induced subgraph __G__[__W__] be 2__k__‐connected, and that for any two vertices at distance two in _

Vertex-disjoint cycles containing specif
Vertex-disjoint cycles containing specified vertices in a bipartite graph
✍ Guantao Chen; Hikoe Enomoto; Ken-ichi Kawarabayashi; Katsuhiro Ota; Dingjun Lou; πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 184 KB

## Abstract A minimum degree condition is given for a bipartite graph to contain a 2‐factor each component of which contains a previously specified vertex. Β© 2004 Wiley Periodicals, Inc. J Graph Theory 46: 145–166, 2004