Algebraic Algorithms for Even Circuits in Graphs

Ha, Huy TaiMorey, Susan2021-07-122021-07-122019-09Hà, H. T., & Morey, S. (2019). Algebraic algorithms for even circuits in graphs. Mathematics, 7(9): 859.2227-7390https://hdl.handle.net/10877/13833We 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.Text18 pages1 file (.pdf)engraphcircuiteven cycledirected cyclemonomial idealrees algebraedge idealMathematicsAlgebraic Algorithms for Even Circuits in GraphsArticle© 2019 The Authors.https://doi.org/10.3390/math7090859This work is licensed under a Creative Commons Attribution 4.0 International License.