Gradual partition of a graph into complete graphs
Časopis pro pěstování matematiky (1978)
- Volume: 103, Issue: 1, page 8-16
- ISSN: 0528-2195
Access Full Article
top
How to cite
topVoldřich, Josef. "Gradual partition of a graph into complete graphs." Časopis pro pěstování matematiky 103.1 (1978): 8-16. <http://eudml.org/doc/21331>.
@article{Voldřich1978,
author = {Voldřich, Josef},
journal = {Časopis pro pěstování matematiky},
language = {eng},
number = {1},
pages = {8-16},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {Gradual partition of a graph into complete graphs},
url = {http://eudml.org/doc/21331},
volume = {103},
year = {1978},
}
TY - JOUR
AU - Voldřich, Josef
TI - Gradual partition of a graph into complete graphs
JO - Časopis pro pěstování matematiky
PY - 1978
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 103
IS - 1
SP - 8
EP - 16
LA - eng
UR - http://eudml.org/doc/21331
ER -
References
top- Blažek, Borák, Holan, Kordík, Voldřiich, Vyhnalík, A report: Students' Research Activity, Fac. of Mathematics and Physics, Charles Univ. 1976. (1976)
- F. Harary, Graph theory, Addison-Wesley, Reading, Mass., 1969. (1969) Zbl0196.27202MR0256911
- J. Nešetřil, Theory of Graphs, (Czech), SNTL, 1978. (1978)
- J. Nešetřil V. Rödl, Partitions propsrties of finite relational and set systems, J. Comb. Th. A, 1977. (1977)
- S. Poljak D. Turzík, On amalgam of graphs and essential sets of generators, J. of Graph Theory.
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.