Let D be a strong digraph on n = 2m + 1 ¸ 5 vertices. In this paper we show that if D contains a cycle of length n¡1, then D has also a cycle which contains all vertices with in-degree and out-degree at least m (unless some extremal cases).
oai:arar.sci.am:258777
ՀՀ ԳԱԱ Հիմնարար գիտական գրադարան
Dec 8, 2023
Jul 24, 2020
11
https://arar.sci.am/publication/281889
Edition name | Date |
---|---|
On cycles through vertices of large semidegree in digraphs | Dec 8, 2023 |
Samvel Kh. Darbinyan Iskandar A. Karapetyan
Samvel Kh. Darbinyan Iskandar A. Karapetyan
Samvel Kh. Darbinyan Iskandar A. Karapetyan