Algebraic Algorithms for Even Circuits in Graphs

Huy Tài Hà and Susan Morey
Additional contact information
Huy Tài Hà: Department of Mathematics, Tulane University, 6823 St. Charles Avenue, New Orleans, LA 70118, USA
Susan Morey: Department of Mathematics, Texas State University, 601 University Drive, San Marcos, TX 78666, USA

Mathematics, 2019, vol. 7, issue 9, 1-18

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.

Keywords: graph; circuit; even cycle; directed cycle; monomial ideal; Rees algebra; edge ideal (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/7/9/859/pdf (application/pdf)
https://www.mdpi.com/2227-7390/7/9/859/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:7:y:2019:i:9:p:859-:d:268039

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().