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

Coverings of the Vertices of a Graph by Small Cycles

โœ Scribed by David Forge; Mekkia Kouider

Publisher
Springer Japan
Year
2007
Tongue
English
Weight
90 KB
Volume
23
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Path coverings of the vertices of a tree
Path coverings of the vertices of a tree
โœ Peter J. Slater ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 840 KB

Consider a collection of disjoint paths in graph G such that every vertex is on one of these paths. The size of the smallest such collection is denoted i(G). A procedure for forming such collections is established. Restricting attention to trees, the range of values for the sizes of the collections