A simple algorithm for finding a cycle of length greater than three and without diagonals
From MaRDI portal
Publication:1147514
DOI10.1007/BF02243441zbMath0449.68026OpenAlexW2922630147MaRDI QIDQ1147514
Publication date: 1981
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02243441
Related Items (1)
Cites Work
This page was built for publication: A simple algorithm for finding a cycle of length greater than three and without diagonals