Algebraic Algorithms for Even Circuits in Graphs

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.

Saved in:
Bibliographic Details
Published inMathematics (Basel) Vol. 7; no. 9; p. 859
Main Authors Hà, Huy Tài, Morey, Susan
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.09.2019
Subjects
Algebra
Algorithms
circuit
Circuits
directed cycle
edge ideal
even cycle
Generators
graph
Graph theory
Jargon
Mathematics
monomial ideal
Rees algebra
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2227-7390
2227-7390
DOI:10.3390/math7090859