Geodesic
Uniquely N-colorable and Chromatically Equivalent Graphs
Bulletin of the Malaysian Mathematical Society, Tome 24 (2001) no. 1 Cet article a éte moissonné depuis la source Bulletin of the Malaysian Mathematical Society website

Voir la notice de l'article

For each integer we present a uniquely n -colorable graph with vertices, and their generalizations. For each integer we present two uniquely graphs which are chromatically equivalent with vertices, and with vertices, and their generalizations. 
@article{BMMS_2001_24_1_a9,
     author = {Chong-Yun Chao},
     title = {Uniquely {N-colorable} and {Chromatically
}                        {Equivalent} {Graphs}},
     journal = {Bulletin of the Malaysian Mathematical Society},
     year = {2001},
     volume = {24},
     number = {1},
     url = {http://geodesic.mathdoc.fr/item/BMMS_2001_24_1_a9/}
}
TY  - JOUR
AU  - Chong-Yun Chao
TI  - Uniquely N-colorable and Chromatically
                        Equivalent Graphs
JO  - Bulletin of the Malaysian Mathematical Society
PY  - 2001
VL  - 24
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/BMMS_2001_24_1_a9/
ID  - BMMS_2001_24_1_a9
ER  - 
%0 Journal Article
%A Chong-Yun Chao
%T Uniquely N-colorable and Chromatically
                        Equivalent Graphs
%J Bulletin of the Malaysian Mathematical Society
%D 2001
%V 24
%N 1
%U http://geodesic.mathdoc.fr/item/BMMS_2001_24_1_a9/
%F BMMS_2001_24_1_a9
Chong-Yun Chao. Uniquely N-colorable and Chromatically
                        Equivalent Graphs. Bulletin of the Malaysian Mathematical Society, Tome 24 (2001) no. 1. http://geodesic.mathdoc.fr/item/BMMS_2001_24_1_a9/