𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Covering the edges of a graph by circuits

✍ Scribed by D. Ya. Kesel'man

Publisher
Springer US
Year
1988
Tongue
English
Weight
847 KB
Volume
23
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Covering the Edges of a Connected Graph
Covering the Edges of a Connected Graph by Paths
✍ L. Pyber πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 316 KB

We prove that every connected graph on n vertices can be covered by at most nΓ‚2+O(n 3Γ‚4 ) paths. This implies that a weak version of a well-known conjecture of Gallai is asymptotically true.

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

Covering a graph with cycles passing thr
Covering a graph with cycles passing through given edges
✍ Wang, Hong πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 91 KB πŸ‘ 2 views

We propose a conjecture: for each integer k β‰₯ 2, there exists N (k) such that if G is a graph of order n β‰₯ N (k) and d(x) + d(y) β‰₯ n + 2k -2 for each pair of nonadjacent vertices x and y of G, then for any k independent edges e 1 , . . . , e k of G, there exist If this conjecture is true, the condi