✦ 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
DOI: 10.1002/net.3230160207

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum augmentation of a tree to a K-ed

Minimum augmentation of a tree to a K-edge-connected graph

✍ Shuichi Ueno; Yoji Kajitani; Hajime Wada 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

The minimum augmentation of any graph to

The minimum augmentation of any graph to a K-edge-connected graph

✍ Guo-Ray Cai; Yu-Geng Sun 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 883 KB

Covering the edge set of a directed grap

Covering the edge set of a directed graph with trees

✍ K. Vidyasankar 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 580 KB

Covering the Edges of a Graph by a Presc

Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap

✍ 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

The Girth of a Directed Distance-Regular

The Girth of a Directed Distance-Regular Graph

✍ D.A. Leonard; K. Nomura 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 149 KB

The Number of Vertices of Degree k in a

The Number of Vertices of Degree k in a Minimally k-Edge-Connected Graph

✍ M.C. Cai 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 346 KB