Article ID Journal Published Year Pages File Type
10523944 Operations Research Letters 2014 4 Pages PDF
Abstract
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.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Vertex disjoint cycles of different lengths in d-arc-dominated digraphs
Authors
,