Chromatically unique bipartite graphs with low 3-independent partition numbers (Q1586760)

The authors prove that for any 2-connected bipartite graph \(G\) which can be 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\), \(G\) is chromatically unique, if the number of 3-independent partitions of \(G\) is at most \(2^{p- 1}+ 2^{q-1}+ s+ 2\).