On the 3-Colouring Vertex Folkman Number F(2,2,4)
Serdica Mathematical Journal (2001)
- Volume: 27, Issue: 2, page 131-136
- ISSN: 1310-6600
Access Full Article
topAbstract
topHow to cite
topNenov, Nedyalko. "On the 3-Colouring Vertex Folkman Number F(2,2,4)." Serdica Mathematical Journal 27.2 (2001): 131-136. <http://eudml.org/doc/11529>.
@article{Nenov2001,
abstract = {In this note we prove that F (2, 2, 4) = 13.},
author = {Nenov, Nedyalko},
journal = {Serdica Mathematical Journal},
keywords = {Vertex Folkman Graph; Vertex Folkman Number; vertex Folkman graph; vertex Folkman number; colouring of graphs},
language = {eng},
number = {2},
pages = {131-136},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {On the 3-Colouring Vertex Folkman Number F(2,2,4)},
url = {http://eudml.org/doc/11529},
volume = {27},
year = {2001},
}
TY - JOUR
AU - Nenov, Nedyalko
TI - On the 3-Colouring Vertex Folkman Number F(2,2,4)
JO - Serdica Mathematical Journal
PY - 2001
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 27
IS - 2
SP - 131
EP - 136
AB - In this note we prove that F (2, 2, 4) = 13.
LA - eng
KW - Vertex Folkman Graph; Vertex Folkman Number; vertex Folkman graph; vertex Folkman number; colouring of graphs
UR - http://eudml.org/doc/11529
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.