Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
22
click to vote
COMBINATORICS
2006
favorite
Email
discuss
report
105
views
more
COMBINATORICS 2006
»
New Upper Bound for a Class of Vertex Folkman Numbers
13 years 9 months ago
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
more »
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)
Researcher Info
COMBINATORICS 2006 Study Group
Computer Vision