Chromatically unique bipartite graphs with certain 3-independent partition numbers. II (Q2469367)

In [Discrete Math. 224, No. 1--3, 107--124 (2000; Zbl 0963.05056)], \textit{F. M. Dong, K. M. Koh, K. L. Teo, C. H. C. Little}, and \textit{M. D. Hendy} proved the chromatic uniqueness of 2-connected bipartite graphs \(G\) such that (a) \(G\) is obtained from \(K_{p,q}\) by deleting a set of \(s\) edges with \(p\geq q\geq 3\) and \(1\leq s\leq q-1\), and (b) \(G\) has no more than \(2^{p-1}+ 2^{q-1}+ s+2\) 3-independent partitions. In the paper under review and its predecessor [``Chromatically unique bipartite graphs with certain 3-independent partition numbers'', per authors], the authors extend the result of Dong et al. to include 2-connected bipartite graphs that satisfy condition (a) and have \(2^{p-1}+ 2^{q-1}+ s+3\) or \(2^{p-1}+ 2^{q-1}+ s+4\) 3-independent partitions.