A Cycle Generation Algorithm for Finite Undirected Linear Graphs
From MaRDI portal
Publication:5585199
DOI10.1145/321541.321545zbMath0191.22801OpenAlexW2085103591MaRDI QIDQ5585199
Publication date: 1969
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321541.321545
Related Items (3)
Variety and connectivity in kinematic chains ⋮ Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion ⋮ A direct method for calculating cell cycles of a block map of a simple planar graph
This page was built for publication: A Cycle Generation Algorithm for Finite Undirected Linear Graphs