Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion

DOI10.1016/j.jda.2007.01.005zbMath1229.05187OpenAlexW1990695762MaRDI QIDQ954963

Marcel Wild

Publication date: 18 November 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2007.01.005

zbMATH Keywords

generating all chordless cyclesgenerating all cyclesgenerating all Hamiltonian cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Gray codes generation algorithm and theoretical evaluation of random walks in \(N\)-cubes

Cites Work

• Unnamed Item
• Unnamed Item
• Polyhedral proof methods in combinatorial optimization
• An Efficient Cycle Vector Space Algorithm for Listing All Cycles of a Planar Graph
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• On Algorithms for Enumerating All Circuits of a Graph
• A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs
• A Cycle Generation Algorithm for Finite Undirected Linear Graphs

This page was built for publication: Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion