On -bounded families of graphs.
Gyárfás, András; Zaker, Manouchehr
The Electronic Journal of Combinatorics [electronic only] (2011)
- Volume: 18, Issue: 1, page Research Paper P108, 8 p., electronic only-Research Paper P108, 8 p., electronic only
- ISSN: 1077-8926
Access Full Article
topHow to cite
topGyárfás, András, and Zaker, Manouchehr. "On -bounded families of graphs.." The Electronic Journal of Combinatorics [electronic only] 18.1 (2011): Research Paper P108, 8 p., electronic only-Research Paper P108, 8 p., electronic only. <http://eudml.org/doc/230407>.
@article{Gyárfás2011,
author = {Gyárfás, András, Zaker, Manouchehr},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research Paper P108, 8 p., electronic only-Research Paper P108, 8 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {On -bounded families of graphs.},
url = {http://eudml.org/doc/230407},
volume = {18},
year = {2011},
}
TY - JOUR
AU - Gyárfás, András
AU - Zaker, Manouchehr
TI - On -bounded families of graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2011
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 18
IS - 1
SP - Research Paper P108, 8 p., electronic only
EP - Research Paper P108, 8 p., electronic only
LA - eng
UR - http://eudml.org/doc/230407
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.