On classes of graphs determined by forbidden subgraphs
Svatopluk Poljak; Vojtěch Rödl
Czechoslovak Mathematical Journal (1983)
- Volume: 33, Issue: 1, page 27-33
- ISSN: 0011-4642
Access Full Article
topHow to cite
topPoljak, Svatopluk, and Rödl, Vojtěch. "On classes of graphs determined by forbidden subgraphs." Czechoslovak Mathematical Journal 33.1 (1983): 27-33. <http://eudml.org/doc/13357>.
@article{Poljak1983,
author = {Poljak, Svatopluk, Rödl, Vojtěch},
journal = {Czechoslovak Mathematical Journal},
keywords = {forbidden subgraphs; universal graphs},
language = {eng},
number = {1},
pages = {27-33},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {On classes of graphs determined by forbidden subgraphs},
url = {http://eudml.org/doc/13357},
volume = {33},
year = {1983},
}
TY - JOUR
AU - Poljak, Svatopluk
AU - Rödl, Vojtěch
TI - On classes of graphs determined by forbidden subgraphs
JO - Czechoslovak Mathematical Journal
PY - 1983
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 33
IS - 1
SP - 27
EP - 33
LA - eng
KW - forbidden subgraphs; universal graphs
UR - http://eudml.org/doc/13357
ER -
References
top- P. Erdös J. Spencer, Probabilistic Methods in Combinatorics, Akademiai Kiadó, Budapest 1974. (1974) MR0382007
- D. L. Greenwell R. L. Hemminger, J.Kleitman, Forbidden Subgraphs, Proc. 4-th S-E Conf. Graph Th. and Computing, Florida Atlantic University (1973), 389-394. (1973) MR0354446
- M. Hall, Jr., Combinatorial Theory, Blaisdell Publ. Соmр., Waltham (Massachusetts), Toronto, London 1967. (1967) Zbl0196.02401MR0224481
- J. Spencer, 10.1016/0097-3165(75)90071-0, Journal of Comb. Th. A 18 (1975), 108-115. (1975) Zbl0296.05003MR0366726DOI10.1016/0097-3165(75)90071-0
- J. Yackel, 10.1016/0095-8956(72)90008-1, Journal of Comb. Th. 13 (1972), 56-58. (1972) Zbl0219.05004MR0304235DOI10.1016/0095-8956(72)90008-1
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.