Algebraic Algorithms for Even Circuits in Graphs
| dc.contributor.author | Ha, Huy Tai | |
| dc.contributor.author | Morey, Susan | |
| dc.date.accessioned | 2021-07-12T16:06:41Z | |
| dc.date.available | 2021-07-12T16:06:41Z | |
| dc.date.issued | 2019-09 | |
| dc.description.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. | |
| dc.description.department | Mathematics | |
| dc.format | Text | |
| dc.format.extent | 18 pages | |
| dc.format.medium | 1 file (.pdf) | |
| dc.identifier.citation | Hà, H. T., & Morey, S. (2019). Algebraic algorithms for even circuits in graphs. Mathematics, 7(9): 859. | |
| dc.identifier.doi | https://doi.org/10.3390/math7090859 | |
| dc.identifier.issn | 2227-7390 | |
| dc.identifier.uri | https://hdl.handle.net/10877/13833 | |
| dc.language.iso | en | |
| dc.publisher | Multidisciplinary Digital Publishing Institute | |
| dc.rights.holder | © 2019 The Authors. | |
| dc.rights.license | This work is licensed under a Creative Commons Attribution 4.0 International License. | |
| dc.source | Mathematics, 2019, Vol. 7, No. 9, Article 859. | |
| dc.subject | graph | |
| dc.subject | circuit | |
| dc.subject | even cycle | |
| dc.subject | directed cycle | |
| dc.subject | monomial ideal | |
| dc.subject | rees algebra | |
| dc.subject | edge ideal | |
| dc.subject | Mathematics | |
| dc.title | Algebraic Algorithms for Even Circuits in Graphs | |
| dc.type | Article |