An attempt to classify bipartite graphs by chromatic polynomials (Q1579550)

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\), \(G\) is chromatically unique, if \(5\leq s\leq q-1\) and \(\Delta(G')= s-1\), or \(7\leq s\leq q-1\) and \(\Delta(G')= s-2\), where \(G'= K_{p,q}- G\).