On Hamiltonian powers of digraphs

DOI10.1007/s003730050007zbMath0946.05054OpenAlexW2027475019MaRDI QIDQ1972325

Antoni Marczyk

Publication date: 23 October 2000

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730050007

zbMATH Keywords

Hamiltonian digraphstrongly connected digraph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis

This page was built for publication: On Hamiltonian powers of digraphs