Distinguishing chromatic numbers of bipartite graphs (Q2380231): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 06:55, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Distinguishing chromatic numbers of bipartite graphs |
scientific article |
Statements
Distinguishing chromatic numbers of bipartite graphs (English)
0 references
26 March 2010
0 references
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}\).
0 references
distinguishing chromatic number
0 references
