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

DOI10.1016/J.JDA.2007.01.005zbMATH Open1229.05187OpenAlexW1990695762MaRDI QIDQ954963FDOQ954963

Authors: 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

Recommendations

• Publication:4731214
• Enumerating Hamiltonian cycles
• Enumeration of Hamiltonian circuits in digraphs
• Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs
• An algorithm for finding all Hamiltonian cycles in a simple graph via hierarchical correlation

zbMATH Keywords

generating all chordless cyclesgenerating all cyclesgenerating all Hamiltonian cycles

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Gray codes generation algorithm and theoretical evaluation of random walks in \(N\)-cubes
• Enumerating \(m\)-length walks in directed graphs with constant delay

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954963)