On uniquely colorable graphs without short cycles
Časopis pro pěstování matematiky (1973)
- Volume: 098, Issue: 2, page 122-125
- ISSN: 0528-2195
Access Full Article
top
How to cite
topNešetřil, Jaroslav. "On uniquely colorable graphs without short cycles." Časopis pro pěstování matematiky 098.2 (1973): 122-125. <http://eudml.org/doc/19311>.
@article{Nešetřil1973,
author = {Nešetřil, Jaroslav},
journal = {Časopis pro pěstování matematiky},
language = {eng},
number = {2},
pages = {122-125},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {On uniquely colorable graphs without short cycles},
url = {http://eudml.org/doc/19311},
volume = {098},
year = {1973},
}
TY - JOUR
AU - Nešetřil, Jaroslav
TI - On uniquely colorable graphs without short cycles
JO - Časopis pro pěstování matematiky
PY - 1973
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 098
IS - 2
SP - 122
EP - 125
LA - eng
UR - http://eudml.org/doc/19311
ER -
References
top- R. L. Brooks, On coloring the nodes of a network, Proc. Cambridge Phil. Soc. 37 (1941), 194-197. (1941) MR0012236
- V. Chvátal, The smallest triangle free 4-chromatic 4-regular graph, (To appear). MR0263691
- B. Griünbaum, A problem in graph coloring, (To appear).
- F. Harary S. T. Hedetniemi, R. W. Robinson, Uniquely colorable graphs, J. Comb. Th. (1969), 260-270. (1969) MR0238735
- F. Harary, Graph theory, Addison Wesley, Reading 1969. (1969) Zbl0196.27202MR0256911
- L. Lovász, On chromatic number of finite set-systems, Acta Math. Acad. Sci. Hungar. 19 (1968), 59-67. (1968) MR0220621
- / Nešetřil, -chromatic graphs without cycles of length , (in Russian) Comment. Math. Univ. Carolinae 7 (1966), 373-376. (1966) MR0201346
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.