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

The minimum augmentation of a directed tree to a k-edge-connected directed graph

โœ Scribed by Yoji Kajitani; Shuichi Ueno


Publisher
John Wiley and Sons
Year
1986
Tongue
English
Weight
520 KB
Volume
16
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Covering the Edges of a Graph by a Presc
โœ Noga Alon; Yair Caro; Raphael Yuster ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 360 KB

Let H=(V H , E H ) be a graph, and let k be a positive integer. A graph G=(V G , E G ) is H-coverable with overlap k if there is a covering of the edges of G by copies of H such that no edge of G is covered more than k times. Denote by overlap(H, G) the minimum k for which G is H-coverable with over