Year: 2012
Type: preprint
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 $\rm SOCDC$. In this paper, we study graphs with $\rm SOCDC$ and obtain some properties of the minimal counterexample to this conjecture.
Source: arXiv (Cornell University)
Authors: Gh., Behrooz Bagheri, Omoomi, Behnaz
Institution: Isfahan University of Technology
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2949532737