For integers p, q, s with p ≥ q ≥ 2 and s ≥ ³ 0, let K2-s(p,q) denote the set of 2-connected bipartite graphs which can be obtained from Kp,q by deleting a set of s edges. In this paper, we prove that for any graph G ? K2 -s (p,q) with p ≥ q ≥ 3, if 11 ≤ s ≤ q –1 and ?(G1) = s -4, where G1 = Kp,q – G, then G is chromatically unique. This result extends both a theorem by Dong et al. [2] and the result in [4].