Geodesic
On uniquely colorable graphs without short cycles
Časopis pro pěstování matematiky, Tome 98 (1973) no. 2, pp. 122-125

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

DOI MR   Zbl

DOI : 10.21136/CPM.1973.108481
Classification : 05C15 
Nešetřil, Jaroslav. On uniquely colorable graphs without short cycles. Časopis pro pěstování matematiky, Tome 98 (1973) no. 2, pp. 122-125. doi: 10.21136/CPM.1973.108481
@article{10_21136_CPM_1973_108481,
     author = {Ne\v{s}et\v{r}il, Jaroslav},
     title = {On uniquely colorable graphs without short cycles},
     journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
     pages = {122--125},
     year = {1973},
     volume = {98},
     number = {2},
     doi = {10.21136/CPM.1973.108481},
     mrnumber = {0325437},
     zbl = {0257.05107},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1973.108481/}
}
TY  - JOUR
AU  - Nešetřil, Jaroslav
TI  - On uniquely colorable graphs without short cycles
JO  - Časopis pro pěstování matematiky
PY  - 1973
SP  - 122
EP  - 125
VL  - 98
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CPM.1973.108481/
DO  - 10.21136/CPM.1973.108481
LA  - en
ID  - 10_21136_CPM_1973_108481
ER  - 
%0 Journal Article
%A Nešetřil, Jaroslav
%T On uniquely colorable graphs without short cycles
%J Časopis pro pěstování matematiky
%D 1973
%P 122-125
%V 98
%N 2
%U http://geodesic.mathdoc.fr/articles/10.21136/CPM.1973.108481/
%R 10.21136/CPM.1973.108481
%G en
%F 10_21136_CPM_1973_108481

[0] R. L. Brooks: On coloring the nodes of a network. Proc. Cambridge Phil. Soc. 37 (1941), 194-197. | MR

[1] V. Chvátal: The smallest triangle free 4-chromatic 4-regular graph. (To appear). | MR

[2] B. Griünbaum: A problem in graph coloring. (To appear).

[3] F. Harary S. T. Hedetniemi, R. W. Robinson: Uniquely colorable graphs. J. Comb. Th. (1969), 260-270. | MR

[4] F. Harary: Graph theory. Addison Wesley, Reading 1969. | MR | Zbl

[5] L. Lovász: On chromatic number of finite set-systems. Acta Math. Acad. Sci. Hungar. 19 (1968), 59-67. | MR

[6] / Nešetřil: $k$-chromatic graphs without cycles of length $\leq 7$. (in Russian) Comment. Math. Univ. Carolinae 7 (1966), 373-376. | MR

Cité par Sources :