A degree condition for cycles of maximum length in bipartite digraphs

作者：Adamus Janusz^*; Adamus Lech

来源：Discrete Mathematics, 2012, 312(6): 1117-1122.

DOI：10.1016/j.disc.2011.11.032

• Digraph
• Bipartite digraph
• Cycle
• Hamiltonicity

We prove a sharp Ore-type criterion for hamiltonicity of balanced bipartite digraphs: for a %26gt;= 2, a bipartite digraph D with colour classes of cardinalities a is hamiltonian if d(+) (u) + d(-)(upsilon) %26gt;= a + 2 whenever u and upsilon lie in opposite colour classes and u upsilon is not an element of A(D).

• 出版日期2012-3-28