Distinguishing chromatic numbers of bipartite graphs (Q2380231)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5686779
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distinguishing chromatic numbers of bipartite graphs |
scientific article; zbMATH DE number 5686779 |
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
0.8502116799354553
0 references
0.8104425668716431
0 references
0.8013317584991455
0 references
0.7944910526275635
0 references
0.7806540727615356
0 references
