An algorithm for finding a circuit of even length in a directed graph

DOI10.1080/00207728408926635zbMath0549.05039OpenAlexW1981918768MaRDI QIDQ3342609

Sudhangshu B. Karmakar

Publication date: 1984

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207728408926635

zbMATH Keywords

directed circuiteven length

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’

Cites Work

• Algebraic determination of circuits in a directed graph
• An Efficient Cycle Vector Space Algorithm for Listing All Cycles of a Planar Graph
• On Algorithms for Enumerating All Circuits of a Graph
• Finding All the Elementary Circuits of a Directed Graph

This page was built for publication: An algorithm for finding a circuit of even length in a directed graph