Sciweavers

197 search results - page 3 / 40
» New Upper Bounds for Ramsey Numbers
Sort
View
COMBINATORICS
1999
83views more  COMBINATORICS 1999»
13 years 7 months ago
New Lower Bounds for Some Multicolored Ramsey Numbers
In this article we use two different methods to find new lower bounds for some multicolored Ramsey numbers. In the first part we use the finite field method used by Greenwood and ...
Aaron Robertson
COMBINATORICS
1998
66views more  COMBINATORICS 1998»
13 years 7 months ago
Some New Ramsey Colorings
New lower bounds for 15 classical Ramsey numbers are established. Several of the colorings are found using a new variation of local search heuristics. Several others are found usi...
Geoffrey Exoo
JGT
2007
87views more  JGT 2007»
13 years 7 months ago
A new upper bound on the cyclic chromatic number
A cyclic colouring of a plane graph is a vertex colouring such that vertices incident with the same face have distinct colours. The minimum number of colours in a cyclic colouring...
Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, ...
COMBINATORICS
2007
84views more  COMBINATORICS 2007»
13 years 7 months ago
A New Upper Bound on the Total Domination Number of a Graph
Michael A. Henning, Anders Yeo