paper

Algebraic algorithms for even circuits in graphs

arXiv:1907.03166 · doi:10.3390/math7090859

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.

arXiv comment19 pages; final version

References in corpus (5)