Distinguishing chromatic numbers of bipartite graphs (Q2380231)

Summary: Extending the work of \textit{K. L. Collins} and \textit{A. N. Trenk} [``The distinguishing chromatic number'', Electron. J. Comb. 13, No. 1, Research paper R16 (2006; Zbl 1081.05033)], we characterize connected bipartite graphs with large distinguishing chromatic number. In particular, if \(G\) is a connected bipartite graph with maximum degree \(\Delta\geq 3\), then \(\chi_D(G)\leq 2\Delta-2\) whenever \(G\not\cong K_{\Delta-1,\Delta}, K_{\Delta,\Delta}\).