Small oriented cycle double cover of graphs

Abstract: A small oriented cycle double cover (SOCDC)} of a bridgeless graph

G

on

n

vertices is a collection of at most

n - 1

directed cycles of the symmetric orientation,

G_{s}

, of

G

such that each edge of

G_{s}

lies in exactly one of the cycles. It is conjectured that every 2-connected graph except two complete graphs

K_{4}

and

K_{6}

has an

m S O C D C

. In this paper, we study graphs with

m S O C D C

and obtain some properties of the minimal counterexample to this conjecture.

Recommendations

Cites work

Cited in

(6)

This page was built for publication: Small oriented cycle double cover of graphs