𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On covers of graphs

✍ Scribed by Maxová Jaroslav; Jana Nešetřil

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
171 KB
Volume
5
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

✦ Synopsis

We concentrate on two problems from the area of coverings of graphs, on an oriented version of Perfect Path Double Cover (PPDC) and on oriented version of Weighted Cycle Cover.

📜 SIMILAR VOLUMES

On total covers of graphs
On total covers of graphs
✍ Yousef Alavi; Jiuqiang Liu; Jianfang Wang; Zhongfu Zhang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 292 KB
On shortest cocycle covers of graphs
On shortest cocycle covers of graphs
✍ François Jaeger; Abdelkader Khelladi; Michel Mollard 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 738 KB
On cycle double covers of line graphs
On cycle double covers of line graphs
✍ Leizhen Cai; Derek Corneil 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 257 KB

It is shown that if a graph has a cycle double cover, then its line graph also has a cycle double cover. The converse of this result for 2-edge-connected graphs would imply the truth of the cycle double cover conjecture. Cycle Double Cover Conjecture (CDCC). Every 2-edge-connected graph has a CDC.

On 2-Arc-Transitive Covers of Complete G
On 2-Arc-Transitive Covers of Complete Graphs
✍ Shao-fei Du; Dragan Marušič; Adrian O Waller 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 282 KB

Regular covers of complete graphs which are 2-arc-transitive are investigated. A classification is given of all such graphs whose group of covering transformations is either cyclic or isomorphic to Z p \_Z p , where p is a prime and whose fibrepreserving subgroup of automorphisms acts 2-arc-transiti

Minimum cycle covers of graphs
Minimum cycle covers of graphs
✍ Fan, Genghua 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 1 views

Some new results on minimum cycle covers are proved. As a consequence, it is obtained that the edges of a bridgeless graph G can be covered by cycles of total length at most |E(G)| + 25 24 (|V (G)| -1), and at most |E(G)| + |V (G)| -1 if G contains no circuit of length 8 or 12.