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.
Related
Batch download
Cited By
noting
Similar Literature
Submit Feedback
Please wait while the file you selected is being converted