Remarks on Hamiltonian properties of powers of digraphs

DOI10.1016/0166-218X(94)90107-4zbMath0801.05029MaRDI QIDQ1329819

Günter Schaar

Publication date: 27 November 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/18259

zbMATH Keywords

digraphpowerHamiltonian pathHamiltonian connecteddirected cacti

Mathematics Subject Classification ID

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

Related Items (5)

On the Hamiltonicity exponent of directed cacti ⋮ An upper bound for the Hamiltonicity exponent of finite digraphs ⋮ The shortest connection game ⋮ Complexity of the directed spanning cactus problem ⋮ CoEulerian graphs

Cites Work

• Unnamed Item
• The square of every two-connected graph is Hamiltonian
• Trees with Hamiltonian square

This page was built for publication: Remarks on Hamiltonian properties of powers of digraphs