𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximating the tree and tour covers of a graph

✍ Scribed by Esther M. Arkin; Magnús M. Halldórsson; Rafael Hassin

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
757 KB
Volume
47
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Double cycle covers and the petersen gra
Double cycle covers and the petersen graph
✍ Paul A. Catlin 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 711 KB

Let O(G) denote the set of odd-degree vertices of a graph G. Let t E N and let 9, denote the family of graphs G whose edge set has a partition This partition is associated with a double cycle cover of G. We show that if a graph G is at most 5 edges short of being 4-edge-connected, then exactly one

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