Algebraic Algorithms for Even Circuits in Graphs

We present an algebraic algorithm to detect the existence of and to list all indecomposable even circuits in a given graph. We also discuss an application of our work to the study of directed cycles in digraphs. View Full-Tex