On the completeness-number of a finite graph
Časopis pro pěstování matematiky, Tome 90 (1965) no. 2, pp. 191-193
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
Havel, Ivan. On the completeness-number of a finite graph. Časopis pro pěstování matematiky, Tome 90 (1965) no. 2, pp. 191-193. doi: 10.21136/CPM.1965.108251
@article{10_21136_CPM_1965_108251,
author = {Havel, Ivan},
title = {On the completeness-number of a finite graph},
journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
pages = {191--193},
year = {1965},
volume = {90},
number = {2},
doi = {10.21136/CPM.1965.108251},
mrnumber = {0191840},
zbl = {0137.18004},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1965.108251/}
}
[1] K. Čulík: Applications of graph theory to mathematical logic and linguistics.Theory of graphs and its applications. Proceedings of the Symposium held in Smolenice (Czechoslovakia), June 17-20, 1963. Nakladatelství ČSAV, Praha 1964, 13-20. | MR
Cité par Sources :