A Note on Hamiltonian Bypasses in Digraphs with Large Degrees
Keyword(s):
Let D be a 2-strongly connected directed graph of order p ≥ 3. Suppose that d(x) ≥ p for every vertex x ∈ V (D) \ {x0}, where x0 is a vertex of D. In this paper, we show that if D is Hamiltonian or d(x0) > 2(p − 1)/5, then D contains a Hamiltonian path, in which the initial vertex dominates the terminal vertex.
2018 ◽
Vol 29
(4)
◽
pp. 830-842
◽
2002 ◽
Vol 45
(3)
◽
pp. 617-630
◽
Keyword(s):
2017 ◽
Vol 27
(03)
◽
pp. 207-219
Keyword(s):
1969 ◽
Vol 21
◽
pp. 769-782
◽
Keyword(s):
1994 ◽
Vol 49
(1)
◽
pp. 9-14
◽
Keyword(s):
2019 ◽
Vol 3
(1)
◽
pp. 35-45
Keyword(s):
2014 ◽
Vol DMTCS Proceedings vol. AT,...
(Proceedings)
◽