Algebraic algorithms for even circuits in graphs
Combinatorics
2019-09-23 v2 Commutative Algebra
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
Cite
@article{arxiv.1907.03166,
title = {Algebraic algorithms for even circuits in graphs},
author = {Huy Tai Ha and Susan Morey},
journal= {arXiv preprint arXiv:1907.03166},
year = {2019}
}
Comments
19 pages; final version