LIÊN KẾT WEBSITE
On 3-regular digraphs without vertex disjoint cycles of different lengths
Discrete Mathematics Số 8, năm 2017 (Tập 340, trang 1933-1943)
DOI: 10.1016/j.disc.2017.03.024
Tài liệu thuộc danh mục: Scopus
Final
English
Tóm tắt tiếng anh
We raise the conjecture that for every integer g≥3 there are only finitely many 3-regular digraphs of girth g without vertex disjoint directed cycles of different lengths and give support for this conjecture by proving that it is true for g=3. © 2017 Elsevier B.V.
