Enumeration of Hamiltonian circuits in digraphs

DOI10.1109/PROC.1985.13325MaRDI QIDQ3060360zbMATH OpenOpenAlexFDO

Authors

Publication date 3 December 2010

Published in Proceedings of the IEEE (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/proc.1985.13325

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Enumerating Hamiltonian cycles
• On the construction and enumeration of Hamiltonian graphs
• scientific article; zbMATH DE number 3946164
• DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits
• scientific article; zbMATH DE number 1192948

Cited in

(14)

• DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits
• On the construction and enumeration of Hamiltonian graphs
• Hamiltonian chains in orgraphs
• A compact form of assignment of all nonexcessive paths in a digraph
• Enumeration of Hamiltonian circuits in rectangular grids
• Reduced-by-matching graphs: toward simplifying Hamiltonian circuit problem
• A new algorithm to find all elementary circuits of a directed graph
• scientific article; zbMATH DE number 3946164 (Why is no real title available?)
• A heuristic method for the determination of a Hamiltonian circuit in a graph
• scientific article; zbMATH DE number 166022 (Why is no real title available?)
• Enumerating Hamiltonian cycles
• scientific article; zbMATH DE number 5064035 (Why is no real title available?)
• Hamiltonian cycle enumeration via fermion-zeon convolution
• Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion

This page was built for publication: Enumeration of Hamiltonian circuits in digraphs

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