On long cycles in a 2-connected bipartite graph

被引：2

作者：

Wang, H ^{[1
]}

机构：

[1] UNIV NEW ORLEANS,DEPT MATH,NEW ORLEANS,LA 70148

来源：

GRAPHS AND COMBINATORICS | 1996年 / 12卷 / 04期

关键词：

D O I：

10.1007/BF01858470

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let k be an integer with k greater than or equal to 2. Let G = (A, B; E) be a 2-connected bipartite graph. Suppose d(x) + d(y) greater than or equal to k + 1 for every pair of non-adjacent vertices x and y. Then G contains a cycle of length at least min(2a, 2k) where a = min(\A\, \B\), unless G is one of some known exceptions. We conjecture that if \A\ = \B\ and d(x) + d(y) greater than or equal to k + 1 for every pair of non-adjacent vertices x and y with x is an element of A and y is an element of B, then G contains a cycle of length at least min(2a, 2k).

引用

页码：373 / 384

页数：12