Pages that link to "Item:Q1302144"

The following pages link to On the complexity of hamiltonian path and cycle problems in certain classes of digraphs (Q1302144):

Displaying 14 items.

• The NPO-completeness of the longest Hamiltonian cycle problem (Q293205) (← links)
• A lower bound for the optimal crossing-free Hamiltonian cycle problem (Q1091399) (← links)
• A note on the Hamiltonian circuit problem on directed path graphs (Q1262132) (← links)
• Complexity of the hamiltonian cycle in regular graph problem (Q1331931) (← links)
• Advances on the Hamiltonian problem -- a survey (Q1396651) (← links)
• Classification of de Bruijn-based labeled digraphs (Q1686053) (← links)
• Time-free solution to Hamilton path problems using P systems with \(d\)-division (Q1791419) (← links)
• Hamiltonian cycle problem in strong \(k\)-quasi-transitive digraphs with large diameter (Q2227120) (← links)
• Semicomplete Multipartite Digraphs (Q3120439) (← links)
• Quasi-Transitive Digraphs and Their Extensions (Q3120440) (← links)
• The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem (Q3323288) (← links)
• (Q4601890) (← links)
• The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems (Q5379885) (← links)
• TSP tour domination and Hamilton cycle decompositions of regular digraphs (Q5939600) (← links)