On a Conjecture on Directed Cycles in a Directed Bipartite Graph

被引：0

作者：

Charles Little

Kee Teo

Hong Wang

机构：

[1] Massey University,Department of Mathematics

[2] University of New Orleans,Department of Mathematics

来源：

Graphs and Combinatorics | 1997年 / 13卷

关键词：

Bipartite Graph; Directed Graph; Discrete Math; Hamilton Cycle; Hamilton Path;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Let D = (V1, V2; A) be a directed bipartite graph with |V1| = |V2| = n ≥ 2. Suppose that dD(x) + dD(y) ≥ 3n for all x ∈ V1 and y ∈ V2. Then, with one exception, D contains two vertex-disjoint directed cycles of lengths 2n1 and 2n2, respectively, for any positive integer partition n = n1 + n2. This proves a conjecture proposed in [9].

引用

页码：267 / 273

页数：6

共 9 条

[1]

Amar D(1986)Partition of a bipartite Hamiltonian graph into two cycles Discrete Math 58 1-10

[2]

Amar D(1991)Covering the vertices of a digraph by cycles of prescribed length Discrete Math 87 111-118

[3]

Raspaud A(1976)A method in graph theory Discrete Math 15 111-135

[4]

Bondy JA(1963)On the maximal number of independent circuits in a graph Acta Math. Acad. Sci. Hungar 14 423-439

[5]

Chvâtal V(1984)On circuits in graphs Discrete Math 50 227-230

[6]

Corrâdi K(1993)Partition of a bipartite graph into cycles Discrete Math 117 287-291

[7]

Hajnal A(undefined)undefined undefined undefined undefined-undefined

[8]

El-Zahar M(undefined)undefined undefined undefined undefined-undefined

[9]

Wang H(undefined)undefined undefined undefined undefined-undefined

← 1 →