On upper embeddability of complementary graphs
Časopis pro pěstování matematiky, Tome 108 (1983) no. 2, pp. 214-217
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
@article{10_21136_CPM_1983_108415,
author = {Nebesk\'y, Ladislav},
title = {On upper embeddability of complementary graphs},
journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
pages = {214--217},
publisher = {mathdoc},
volume = {108},
number = {2},
year = {1983},
doi = {10.21136/CPM.1983.108415},
mrnumber = {704067},
zbl = {0524.05030},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1983.108415/}
}
TY - JOUR AU - Nebeský, Ladislav TI - On upper embeddability of complementary graphs JO - Časopis pro pěstování matematiky PY - 1983 SP - 214 EP - 217 VL - 108 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/articles/10.21136/CPM.1983.108415/ DO - 10.21136/CPM.1983.108415 LA - en ID - 10_21136_CPM_1983_108415 ER -
Nebeský, Ladislav. On upper embeddability of complementary graphs. Časopis pro pěstování matematiky, Tome 108 (1983) no. 2, pp. 214-217. doi: 10.21136/CPM.1983.108415
Cité par Sources :