Hu, Z

Law, KH

Zang, W

SIAM Journal on Discrete Mathematics

G = (V1, V2, E) be a balanced bipartite graph with 2n vertices. The bipartite binding number of G, denoted by B(G), is defined to be n if G = Kn,n and mini ∈ {1,2} min ∅=S⊆Vi |N(S)|&lt;n |N(S)|/|S | otherwise. We call G bipancyclic if it contains a cycle of ev-ery even length m for 4 ≤ m ≤ 2n. The purpose of this paper is to show that if B(G)&gt; 3/2 and n ≥ 139, then G is bipancyclic; the bound 3/2 is best possible in the sense that there exist infinitely many balanced bipartite graphs G that have B(G)  = 3/2 but are not Hamiltonian

Z. Hu

Ka Ho  Law

Wenan Zang

CiteSeerX

An Optimal Binding Number Condition for Bipancyclism

HKU Scholars Hub

http://hub.hku.hk/bitstream/10722/185942/1/Content.pdf

An Optimal Binding Number Condition for Bipancyclism

Abstract

Similar works

Full text

Available Versions

CiteSeerX

HKU Scholars Hub