scientific article; zbMATH DE number 1192948

MaRDI QIDQ3841508zbMATH OpenFDO

Authors Qifan Yang

Publication date 19 January 1999

zbMATH Keywords

circulant digraphefficient algorithmhamiltonian cycleshamiltonicitytravelling salesman problem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Hamiltonian cycles in circulant digraphs with two stripes
• scientific article; zbMATH DE number 5064035
• Hamilton cycles in circulant digraphs with prescribed number of distinct jumps

Cited in

(9)

• Hamilton cycles in circulant digraphs with prescribed number of distinct jumps
• Hamiltonian cycles in (2,3,c)-circulant digraphs
• DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits
• Hamiltonian cycles in circulant digraphs with two stripes
• Hamiltonicity of digraphs for universal cycles of permutations
• Enumeration of Hamiltonian circuits in digraphs
• Hamiltonian Cycles in Striped Graphs: The Two-Stripe Problem
• OPTIMUM REQUIREMENT HAMILTON CYCLE PROBLEM WITH A MONGE-LIKE PROPERTY
• Hamiltonicity properties of circulant digraphs of semiprime or power of prime order

This page was built for publication:

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