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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.