Sciweavers

217 search results - page 3 / 44
» A new upper bound on the cyclic chromatic number
Sort
View
SIAMDM
2008
148views more  SIAMDM 2008»
13 years 6 months ago
A New Algorithm for On-line Coloring Bipartite Graphs
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...
Hajo Broersma, Agostino Capponi, Daniël Paulu...
GC
2008
Springer
13 years 6 months ago
On the Acyclic Chromatic Number of Hamming Graphs
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
Robert E. Jamison, Gretchen L. Matthews
DM
2007
89views more  DM 2007»
13 years 6 months ago
New upper bound formulas with parameters for Ramsey numbers
In this paper, we obtain some new results R(5, 12) 848, R(5, 14) 1461, etc., and we obtain new upper bound formulas for Ramsey numbers with parameters. © 2006 Published by Elsevi...
Yi Ru Huang, Yuandi Wang, Wancheng Sheng, Jian She...
COMBINATORICS
2007
84views more  COMBINATORICS 2007»
13 years 6 months ago
A New Upper Bound on the Total Domination Number of a Graph
Michael A. Henning, Anders Yeo