A panconnectivity theorem for bipartite graphs

作者：Du Hui; Faudree Ralph J; Lehel Jeno^*; Yoshimoto Kiyoshi

来源：Discrete Mathematics, 2018, 341(1): 151-154.

DOI：10.1016/j.disc.2017.08.024

• Bipartite graph
• Circumference
• Panconnectivity

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.

• 出版日期2018-1