LIÊN KẾT WEBSITE
Vertex disjoint cycles of different lengths in d-arc-dominated digraphs
Operations Research Letters Số 5, năm 2014 (Tập 42, trang 351-354)
ISSN: 1676377
ISSN: 1676377
DOI: 10.1016/j.orl.2014.06.004
Tài liệu thuộc danh mục: Scopus
Article
English
Từ khóa: Management science; Operations research; d-arc-dominated digraph; d-regular digraph; Outdegree; Vertex-disjoint cycles; Vertex-disjoint directed cycles; Directed graphs
Tóm tắt tiếng anh
Gao and Ma (2013) have proved that every 4-arc-dominated digraph contains two vertex disjoint directed cycles of different lengths. In this paper, by arguments similar to those used by Gao and Ma in the above-mentioned paper, we show that every d-arc-dominated digraph with d≥4 contains two vertex disjoint directed cycles of different lengths. © 2014 Elsevier Inc. All rights reserved. © 2014 Elsevier Inc. All rights reserved.
