New sufficient conditions for bipancyclic bipartite graphs

被引：3

作者：

Abderrezzak, ME ^{[1
]}

Flandrin, E ^{[1
]}

机构：

[1] Univ Paris 11, LRI, CNRS, URA 410, F-91405 Orsay, France

来源：

DISCRETE MATHEMATICS | 2004年 / 286卷 / 1-2期

关键词：

graphs; bipartite; cycles; pancyclic; closure;

D O I：

10.1016/j.disc.2003.11.039

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We give here two sufficient conditions for a bipartite balanced graph of order 2n to be bipancyclic. The first one concerns graphs that satisfy a "bipartite Ore's condition", that is graphs such that any two nonadjacent vertices in both parts of the bipartition have degree sum at least n, and the second one is for bipartite balanced traceable graphs containing an hamiltonian path whose extremities are nonadjacent and have degree sum at least n + 1, (C) 2004 Elsevier B.V. All rights reserved.

引用

页码：5 / 13

页数：9