𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Covering vertices by a specified number of disjoint cycles, edges and isolated vertices

✍ Scribed by Shuya Chiba; Shinya Fujita

Book ID
118271594
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
250 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Covering the vertices of a graph by cycl
Covering the vertices of a graph by cycles of prescribed length
✍ D. Amar; I. Fournier; A. Germa πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 321 KB

The main theorem of that paper is the following: let G be a graph of order n, of size at least (nZ -3n + 6 ) / 2 . For any integers k, n,, n2,. . . , nk such that n = n, + n2 + ... + nk and n, 2 3, there exists a covering of the vertices of G by disjoint cycles (C,),=,..,k with ICjl = n,, except whe