Equivalence of a Number-Theoretical Problem with a Problem from the Graph Theory
Matematický časopis (1967)
- Volume: 17, Issue: 3, page 240-241
- ISSN: 0232-0525
Access Full Article
top
How to cite
topZnám, Štefan. "Equivalence of a Number-Theoretical Problem with a Problem from the Graph Theory." Matematický časopis 17.3 (1967): 240-241. <http://eudml.org/doc/30095>.
@article{Znám1967,
author = {Znám, Štefan},
journal = {Matematický časopis},
language = {eng},
number = {3},
pages = {240-241},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {Equivalence of a Number-Theoretical Problem with a Problem from the Graph Theory},
url = {http://eudml.org/doc/30095},
volume = {17},
year = {1967},
}
TY - JOUR
AU - Znám, Štefan
TI - Equivalence of a Number-Theoretical Problem with a Problem from the Graph Theory
JO - Matematický časopis
PY - 1967
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 17
IS - 3
SP - 240
EP - 241
LA - eng
UR - http://eudml.org/doc/30095
ER -
References
top- Erdős P., Graph theory and probability II., Canad. J. Math. 13 (1961), 346-352. (1961) MR0120168
- Greenwood R. E., Gleason A. M., Combinatorial relations and chromatic graphs, Canad. J. Math. 7 (1955), 1-7. (1955) Zbl0064.17901MR0067467
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.