An upper bound for the Hamiltonicity exponent of finite digraphs

DOI10.1016/S0012-365X(96)00066-0zbMath0876.05065OpenAlexW2335477439MaRDI QIDQ1356721

Günter Schaar, Adam Paweł Wojda

Publication date: 10 June 1997

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00066-0

zbMATH Keywords

digraphHamiltonianHamiltonian pathHamiltonicity exponent

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

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

Cites Work

• Unnamed Item
• Remarks on Hamiltonian properties of powers of digraphs
• The square of every two-connected graph is Hamiltonian
• Cycles in digraphs– a survey

This page was built for publication: An upper bound for the Hamiltonicity exponent of finite digraphs