• Corpus ID: 117890099

# On Hamiltonian Bypasses in one Class of Hamiltonian Digraphs

```@article{Darbinyan2014OnHB,
title={On Hamiltonian Bypasses in one Class of Hamiltonian Digraphs},
author={Samvel Kh. Darbinyan and Iskandar Karapetyan},
journal={arXiv: Combinatorics},
year={2014}
}```
• Published 23 April 2014
• Mathematics
• arXiv: Combinatorics
Let \$D\$ be a strongly connected directed graph of order \$n\geq 4\$ which satisfies the following condition (*): for every pair of non-adjacent vertices \$x, y\$ with a common in-neighbour \$d(x)+d(y)\geq 2n-1\$ and \$min \{ d(x), d(y)\}\geq n-1\$. In \cite{} (J. of Graph Theory 22 (2) (1996) 181-187)) J. Bang-Jensen, G. Gutin and H. Li proved that \$D\$ is Hamiltonian. In  it was shown that if \$D\$ satisfies the condition (*) and the minimum semi-degree of \$D\$ at least two, then either \$D\$ contains…
4 Citations

### On Hamiltonian bypasses in digraphs with the condition of Y. Manoussakis

• S. Darbinyan
• Mathematics
2015 Computer Science and Information Technologies (CSIT)
• 2015
Let D be a strongly connected directed graph of order n ≥ 4 which satisfies the following condition for every triple x, y, z of vertices such that x and y are nonadjacent: If there is no arc from x

### A Note on Hamiltonian Bypasses in Digraphs with Large Degrees

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

• 2014