Geodesic
Distinguishing chromatic numbers of bipartite graphs
The electronic journal of combinatorics, Tome 16 (2009) no. 1

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
Extending the work of K.L. Collins and A.N. Trenk, 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}$.
DOI : 10.37236/165
Classification : 05C15, 05C25
Mots-clés : distinguishing chromatic number 
C. Laflamme; K. Seyffarth. Distinguishing chromatic numbers of bipartite graphs. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/165
@article{10_37236_165,
     author = {C. Laflamme and K. Seyffarth},
     title = {Distinguishing chromatic numbers of bipartite graphs},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/165},
     zbl = {1186.05054},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/165/}
}
TY  - JOUR
AU  - C. Laflamme
AU  - K. Seyffarth
TI  - Distinguishing chromatic numbers of bipartite graphs
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/165/
DO  - 10.37236/165
ID  - 10_37236_165
ER  - 
%0 Journal Article
%A C. Laflamme
%A K. Seyffarth
%T Distinguishing chromatic numbers of bipartite graphs
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/165/
%R 10.37236/165
%F 10_37236_165

Cité par Sources :