Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

75

Voted

COMBINATORICS
2006

105views more COMBINATORICS 2006»

New Upper Bound for a Class of Vertex Folkman Numbers

15 years 2 months ago

New Upper Bound for a Class of Vertex Folkman Numbers

Download www.maths.tcd.ie

N. Kolev, N. Nenov

Real-time Traffic

COMBINATORICS 2006 |

claim paper

Related Content

» An almost quadratic bound on vertex Folkman numbers

» Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies

» A new upper bound on the cyclic chromatic number

» On a New Class of Codes for Identifying Vertices in Graphs

» Vertex Cover in Graphs with Locally Few Colors

» On the geodetic number and related metric sets in Cartesian product graphs

» Solving SAT using vertex covers

» Algorithmic Metatheorems for Restrictions of Treewidth

» Forbidden Subgraph Colorings and the Oriented Chromatic Number

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	COMBINATORICS
Authors	N. Kolev, N. Nenov

Comments (0)