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

Edge-cutsets in the directed hypercube

โœ Scribed by Paul L. Mariz; Shahriar Shahriari

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
98 KB
Volume
39
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Routing a Permutation in the Hypercube b
Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths
โœ Qian-Ping Gu; Hisao Tamaki ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 95 KB

Consider a hypercube regarded as a directed graph, with one edge in each direction between each pair of adjacent nodes. We show that any permutation on the hypercube can be partitioned into two partial permutations of the same size so that each of them can be routed by edge-disjoint directed paths.

Edge-disjoint cycles in regular directed
Edge-disjoint cycles in regular directed graphs
โœ Alon, Noga; McDiarmid, Colin; Molloy, Michael ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 356 KB ๐Ÿ‘ 3 views

We prove that any k-regular directed graph with no parallel edges contains a collection of at least fl(k2) edge-disjoint cycles; we conjecture that in fact any such graph contains a collection of at least ( lCi1 ) disjoint cycles, and note that this holds for k 5 3. o 1996