Abstract#R##N##R##N#We say that a digraph D has the odd cycle property if there exists an edge subset S such that every cycle of D has an odd number of edges from S. We give necessary and sufficient conditions for a digraph to have the odd cycle property. We also consider the analogous problem for graphs.
['Rachel Manber', 'Shao Jy']
On digraphs with the odd cycle property