On the completeness-number of a finite graph. II.
Časopis pro pěstování matematiky (1968)
- Volume: 093, Issue: 2, page 158-169
- ISSN: 0528-2195
Access Full Article
top
How to cite
topHavel, Ivan. "On the completeness-number of a finite graph. II.." Časopis pro pěstování matematiky 093.2 (1968): 158-169. <http://eudml.org/doc/19398>.
@article{Havel1968,
author = {Havel, Ivan},
journal = {Časopis pro pěstování matematiky},
keywords = {topology},
language = {eng},
number = {2},
pages = {158-169},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {On the completeness-number of a finite graph. II.},
url = {http://eudml.org/doc/19398},
volume = {093},
year = {1968},
}
TY - JOUR
AU - Havel, Ivan
TI - On the completeness-number of a finite graph. II.
JO - Časopis pro pěstování matematiky
PY - 1968
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 093
IS - 2
SP - 158
EP - 169
LA - eng
KW - topology
UR - http://eudml.org/doc/19398
ER -
References
top- K. Čulík, Аppliсationѕ of graph thеory to mathеmatiсal logiс and linguiѕtiсѕ, in: Thеory of graphѕ and itѕ appliсationѕ. Proсееdingѕ of thе Sympoѕium hеld in Smolеniсе (Czесhoѕlovakia), Junе 17-20, 1963. Nakladatеlѕtví ČSАV, Praha 1964, 13-20. (1963)
- B. Grünbaum, А problеm in gгaph сołoring, In print.
- I. Havel, On thе сomplеtеnеѕѕ-numbеr of a fìnitе graph, Čaѕ. pӗѕt. mat., vol. 90 (1965), 191-193. (1965) MR0191840
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.