A panconnectivity theorem for bipartite graphs

被引：3

作者：

Du, Hui ^{[1
]}

Faudree, Ralph J. ^{[2
]}

Lehel, Jeno ^{[3
,4
]}

Yoshimoto, Kiyoshi ^{[5
]}

机构：

[1] Nagakura 2722, Karuizawa, Nagano 3890111, Japan

[2] Univ Memphis, Memphis, TN 38152 USA

[3] Univ Louisville, Louisville, KY 40292 USA

[4] Hungarian Acad Sci, Alfred Renyi Inst Math, Budapest, Hungary

[5] Nihon Univ, Tokyo 1018308, Japan

来源：

DISCRETE MATHEMATICS | 2018年 / 341卷 / 01期

关键词：

Bipartite graph; Circumference; Panconnectivity; PANCYCLICITY;

D O I：

10.1016/j.disc.2017.08.024

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G be a simple m x n bipartite graph with m >= n. We prove that if the minimum degree of G satisfies delta(G) >= m/2 + 1, then G is bipanconnected: for every pair of vertices x, y, and for every appropriate integer 2 <= 2 <= 2n, there is an x, y-path of length t in G. (C) 2017 Elsevier B.V. All rights reserved.

引用

页码：151 / 154

页数：4

共 7 条

[1] BICLOSURE AND BISTABILITY IN A BALANCED BIPARTITE GRAPH [J].