On tree-complete graphs
Časopis pro pěstování matematiky (1975)
- Volume: 100, Issue: 4, page 334-338
- ISSN: 0528-2195
Access Full Article
top
How to cite
topNebeský, Ladislav. "On tree-complete graphs." Časopis pro pěstování matematiky 100.4 (1975): 334-338. <http://eudml.org/doc/21252>.
@article{Nebeský1975,
author = {Nebeský, Ladislav},
journal = {Časopis pro pěstování matematiky},
language = {eng},
number = {4},
pages = {334-338},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {On tree-complete graphs},
url = {http://eudml.org/doc/21252},
volume = {100},
year = {1975},
}
TY - JOUR
AU - Nebeský, Ladislav
TI - On tree-complete graphs
JO - Časopis pro pěstování matematiky
PY - 1975
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 100
IS - 4
SP - 334
EP - 338
LA - eng
UR - http://eudml.org/doc/21252
ER -
References
top- M. Behzad G. Chartrand, No graph is perfect, Amer. Math. Monthly 74 (1967), 962-963. (1967) MR0220627
- M. Behzad G. Chartrand, Introduction to the Theory of Graphs, Allyn and Bacon, Inc., Boston 1971. (1971) MR0432461
- /. Sedláček, O perfektních a kvaziperfektních grafech, Čas. pěst. mat. 100 (1975), 135 - 141. (1975) MR0416994
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.