On the completeness-number of a finite graph

Ivan Havel

Časopis pro pěstování matematiky (1965)

  • Volume: 090, Issue: 2, page 191-193
  • ISSN: 0528-2195

How to cite

top

Havel, Ivan. "On the completeness-number of a finite graph." Časopis pro pěstování matematiky 090.2 (1965): 191-193. <http://eudml.org/doc/19081>.

@article{Havel1965,
author = {Havel, Ivan},
journal = {Časopis pro pěstování matematiky},
keywords = {topology},
language = {eng},
number = {2},
pages = {191-193},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {On the completeness-number of a finite graph},
url = {http://eudml.org/doc/19081},
volume = {090},
year = {1965},
}

TY - JOUR
AU - Havel, Ivan
TI - On the completeness-number of a finite graph
JO - Časopis pro pěstování matematiky
PY - 1965
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 090
IS - 2
SP - 191
EP - 193
LA - eng
KW - topology
UR - http://eudml.org/doc/19081
ER -

References

top
  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. (1963) MR0176940

NotesEmbed ?

top

You 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.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.