Affiliation:
1. Institute for Informatics and Automation Problems of NAS RA
Abstract
R. Wang (Discrete Mathematics and Theoretical Computer Science, vol. 19(3), 2017) proposed the following problem. Problem. Let D be a strongly connected balanced bipartite directed graph of order 2a ≥8. Suppose that d(x) ≥ 2a - k, d(y) ≥a + k or d(y) ≥2a - k, d(x) ≥a + k for every pair of vertices {x; y}with a common out-neighbour, where 2 • k • a=2. Is D Hamiltonian? In this paper, we prove that if a digraph D satis¯es the conditions of this problem, then (i) D contains a cycle factor, (ii) for every vertex x ∈ V (D) there exists a vertex y ∈ V (D) such that x and y have a common out-neighbour.
Publisher
Institute for Informatics and Automation Problems - NAS RA
Reference20 articles.
1. J. Bang-Jensen and G. Gutin, Digraphs: Theory, Algorithms and Applications, Springer, 2001
2. G. Gutin, Criterion for complete bipartite digraphs to be Hamiltonian" , Vestsi Akad, Navuk BSSR Ser. Fiz.-Mat. Navuk vol. 1 , pp. 109-110, 1984.
3. G. Gutin, ‘’ Cycles and paths in semicomplete multipartite digraphs, theorems and algorithms: a survey" J. Graph Theory vol. 19, no. 4, pp. 481-505, 1995.
4. R. H Äaggkvist and Y .Manoussakis, Cycles and paths in bipartite tournaments with spanning con¯gurations" . Combinatorica, vol. 9, no. 1 , pp. 33-38, 1989.
5. Y .Manoussakis and I. Millis, A suffcient condition for maximum cycles in bipartite digraphs" , Discrete Math., vol. 207, pp. 161 -171 , 1999.