On a Conjecture on Directed Cycles in a Directed Bipartite Graph
- 44 Downloads
Let D = (V 1, V 2; A) be a directed bipartite graph with |V 1| = |V 2| = n ≥ 2. Suppose that d D (x) + d D (y) ≥ 3n for all x ∈ V 1 and y ∈ V 2. Then, with one exception, D contains two vertex-disjoint directed cycles of lengths 2n 1 and 2n 2, respectively, for any positive integer partition n = n 1 + n 2. This proves a conjecture proposed in .
KeywordsBipartite Graph Directed Graph Discrete Math Hamilton Cycle Hamilton Path
Unable to display preview. Download preview PDF.