The following pages link to On Hamiltonian powers of digraphs (Q1972325):
Displaying 11 items.
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
- Graph powers and \(k\)-ordered hamiltonicity (Q932592) (← links)
- Vertex-primitive digraphs of prime-power order are hamiltonian (Q1322207) (← links)
- Remarks on Hamiltonian properties of powers of digraphs (Q1329819) (← links)
- An upper bound for the Hamiltonicity exponent of finite digraphs (Q1356721) (← links)
- On traceable powers of digraphs (Q1970584) (← links)
- Hamiltonicity of digraphs for universal cycles of permutations (Q2493100) (← links)
- Remarks on Hamiltonian digraphs (Q2712516) (← links)
- Hamiltonian-colored powers of strong digraphs (Q2866416) (← links)
- (Q3701451) (← links)
- (Q4518400) (← links)
