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

Partitioning graphs into Hamiltonian ones

โœ Scribed by Lin Chen

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
851 KB
Volume
22
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Partition of a bipartite hamiltonian gra
Partition of a bipartite hamiltonian graph into two cycles
โœ Denise Amar ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 480 KB

We prove the following theorem. "I'neorem. If G is a balanced bipartite graph with bipartition (A, B), [A I = IBI = n, such that for any x ~ A, y ~ B, d(x) + d(y) >>-n + 2, then for any (nl, n2), ni >I 2, n -----n I + hE, G contains two independent cycles of lengths 2nl and 2n2.

On partitions of graphs into trees
On partitions of graphs into trees
โœ F.R.K. Chung ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 934 KB

We crgnsider the minimum m\*-nber T(G) of subsets intl:, which the edge set E(G) of a graph G can lx partitioned so that each subset forms a tree. It is shown that for any connected (3 with II vertices, we always have T( Gj s [$I.

Partitioning random graphs into large cy
Partitioning random graphs into large cycles
โœ A.M. Frieze ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 833 KB

Let r 3 1 be a tied positive integer. We give the limiting distribution for the probability that the vertices of a random graph can be partitioned equitably into I cycles.

Hamiltonian decompositions of complete r
Hamiltonian decompositions of complete regular s-partite graphs
โœ A.J.W. Hilton; C.A. Rodger ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 962 KB

In this paper we give a procedure by which Hamiltonian decompositions of the s-partite graph K~.....,~, where (s-1)n is even, can be constructed. For 2t<~s, l<~al<~...<~a~n, we find conditions which are necessary and sufficient for a decomposition of the edge-set of Kal.a2..... ~ into (s-1)n/2 class