𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Covering the edges of a graph by three odd subgraphs

✍ Scribed by Tamás Mátrai

Publisher
John Wiley and Sons
Year
2006
Tongue
English
Weight
110 KB
Volume
53
Category
Article
ISSN
0364-9024

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

Separation of graphs into three componen
Separation of graphs into three components by the removal of edges
✍ Donald L. Goldsmith; Bennet Manvel; Vance Faber 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB

## Abstract Several ways to separate a connected graph into three components by the removal of edges are discussed. Graphical parameters that count the number of edges removed are introduced and the relations between these parameters are given.

Covering the vertices of a graph by cycl
Covering the vertices of a graph by cycles of prescribed length
✍ D. Amar; I. Fournier; A. Germa 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB

The main theorem of that paper is the following: let G be a graph of order n, of size at least (nZ -3n + 6 ) / 2 . For any integers k, n,, n2,. . . , nk such that n = n, + n2 + ... + nk and n, 2 3, there exists a covering of the vertices of G by disjoint cycles (C,),=,..,k with ICjl = n,, except whe