𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Small cycle double covers of 4-connected planar graphs

✍ Scribed by Karen Seyffarth

Publisher
Springer-Verlag
Year
1993
Tongue
English
Weight
297 KB
Volume
13
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

HajΓ³s' conjecture and small cycle double
HajΓ³s' conjecture and small cycle double covers of planar graphs
✍ Karen Seyffarth πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 865 KB

## Seyffarth, K., Hajos' conjecture and small cycle double covers of planar graphs, Discrete Mathematics 101 (1992) 291-306. We prove that every simple even planar graph on n vertices has a partition of its edge set into at most [(n -1)/2] cycles. A previous proof of this result was given by Tao,

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.

Edge-reconstruction of 4-connected plana
Edge-reconstruction of 4-connected planar graphs
✍ S. Fiorini; J. Lauri πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 482 KB πŸ‘ 2 views

## Abstract The object of this paper is to show that 4‐connected planar graphs are uniquely determined from their collection of edge‐deleted subgraphs.