Algebraic algorithms for even circuits in graphs

Abstract

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.

19 pages; final version

References in corpus (2)

• The equations defining blowup algebras of height three Gorenstein ideals
• Finding Even Cycles Faster via Capped k-Walks