𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Vertex-disjoint chorded cycles in a graph

✍ Scribed by Shengning Qiao; Shenggui Zhang


Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
208 KB
Volume
38
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Disjoint cycles with chords in graphs
✍ Ch. Sobhan Babu; Ajit A. Diwan πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 134 KB

## Abstract Let $n\_1,n\_2,\ldots,n\_k$ be integers, $n=\sum n\_i$, $n\_i\ge 3$, and let for each $1\le i\le k$, $H\_i$ be a cycle or a tree on $n\_i$ vertices. We prove that every graph __G__ of order at least __n__ with $\sigma\_2(G) \ge 2( n-k) -1$ contains __k__ vertex disjoint subgraphs $H\_1'

Vertex-disjoint cycles containing specif
✍ 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

A vertex cover with chorded 4-cycles
✍ Yun Shu Gao; Guo Jun Li; Jin Yan πŸ“‚ Article πŸ“… 2011 πŸ› Institute of Mathematics, Chinese Academy of Scien 🌐 English βš– 218 KB