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

Arc-disjoint in-trees in directed graphs

โœ Scribed by Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa

Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
752 KB
Volume
29
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Vertex-disjoint paths and edge-disjoint
Vertex-disjoint paths and edge-disjoint branchings in directed graphs
โœ R. W. Whitty ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 482 KB

A theorem of J. Edmonds states that a directed graph has k edge-disjoint branchings rooted at a vertex r if and only if every vertex has k edge-disjoint paths to r . We conjecture an extension of this theorem to vertex-disjoint paths and give a constructive proof of the conjecture in the case k = 2.

Disjoint directed quadrilaterals in a di
Disjoint directed quadrilaterals in a directed graph
โœ Danhong Zhang; Hong Wang ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 139 KB

## Abstract Let __D__ be a directed graph of order 4__k__, where __k__ is a positive integer. Suppose that the minimum degree of __D__ is at least 6__k__โ€‰โˆ’โ€‰2. We show that __D__ contains __k__ disjoint directed quadrilaterals with only one exception. ยฉ 2005 Wiley Periodicals, Inc. J Graph Theory

Covering directed graphs by in-trees
Covering directed graphs by in-trees
โœ Naoyuki Kamiyama; Naoki Katoh ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Springer US ๐ŸŒ English โš– 646 KB