• 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}
}
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{[2]} (J. of Graph Theory 22 (2) (1996) 181-187)) J. Bang-Jensen, G. Gutin and H. Li proved that $D$ is Hamiltonian. In [9] 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

A pr 2 01 4 On Hamiltonian Bypasses in Digraphs with the Condition of Y

  • 2014

References

SHOWING 1-10 OF 15 REFERENCES

A note on long non-hamiltonian cycles in one class of Digraphs

  • S. DarbinyanI. Karapetyan
  • Mathematics
    Ninth International Conference on Computer Science and Information Technologies Revised Selected Papers
  • 2013
Let D be a strong digraph on n ≥ 4 vertices. In [3, Discrete Applied Math., 95 (1999) 77-87)], J. Bang-Jensen, Y. Guo and A. Yeo proved the following theorem: if (*) d(x) + d(y) ≥ 2n-1 and

A sufficient condition for the hamiltonian property of digraphs with large semi-degrees

Let $D$ be a digraph on $p\geq 5$ vertices with minimum degree at least $p-1$ and with minimum semi-degree at least $p/2-1$. For $D$ (unless some extremal cases) we present a detailed proof of the

Long Cycles in Digraphs

Introduction By Ghouila-Houri's theorem [10], every strong digraph of order n and with minimum degree at least n is Hamiltonian. Extensions of this theorem can be found in [11, 13, 16, 18].

On the existence of a specified cycle in digraphs with constraints on degrees

We prove that Woodall's and Ghouila-Houri's conditions on degrees which ensure that a digraph is Hamiltonian, also ensure that it contains the analog of a directed Hamiltonian cycle but with one edge

Sufficient conditions for a digraph to be Hamiltonian

TLDR
A new type of sufficient condition for a digraph to be Hamiltonian is described, which combines local structure of the digraph with conditions on the degrees of non-adjacent vertices.

A short proof of Meyniel's theorem

Digraphs: Theory

  • Algorithms and Applications, Springer
  • 2000