Strongly Hamiltonian-connected locally semicomplete digraphs
Yubao Guo · Journal of Graph Theory · 1996
We give some sufficient conditions for locally semicomplete digraphs to contain a hamiltonian path from a prescribed vertex to another prescribed vertex. As an immediate consequence of these, we obtain that every 4-connected locally semicomplete digraph is strongly hamiltonian-connected. Our results extend those of Thomassen [12] for tournaments. © 1996 John Wiley & Sons, Inc.