Enumeration of Hamiltonian circuits in digraphs

DOI10.1109/PROC.1985.13325zbMATH Open1200.94069OpenAlexW1995429773MaRDI QIDQ3060360FDOQ3060360

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

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

Mathematics Subject Classification ID

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

Cited In (13)

• Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion
• DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits
• Hamiltonian cycle enumeration via fermion-zeon convolution
• Hamiltonian chains in orgraphs
• Title not available (Why is that?)
• On the construction and enumeration of Hamiltonian graphs
• Enumerating Hamiltonian cycles
• Enumeration of Hamiltonian circuits in rectangular grids
• Title not available (Why is that?)
• A heuristic method for the determination of a Hamiltonian circuit in a graph
• A new algorithm to find all elementary circuits of a directed graph
• Title not available (Why is that?)
• Reduced-by-matching graphs: toward simplifying Hamiltonian circuit problem

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)