Algebraic Algorithms for Even Circuits in Graphs
Date
2019-09
Authors
Ha, Huy Tai
Morey, Susan
Journal Title
Journal ISSN
Volume Title
Publisher
Multidisciplinary Digital Publishing Institute
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.
Description
Keywords
graph, circuit, even cycle, directed cycle, monomial ideal, rees algebra, edge ideal, Mathematics
Citation
Hà, H. T., & Morey, S. (2019). Algebraic algorithms for even circuits in graphs. Mathematics, 7(9): 859.
Rights
Rights Holder
© 2019 The Authors.
Rights License
This work is licensed under a Creative Commons Attribution 4.0 International License.