721 search results - page 5 / 145 » Almost universal graphs |
ARSCOM
1999
13 years 7 months ago
1999
Alon and Yuster [4] have proven that if a fixed graph K on g vertices is (h + 1)-colorable, then any graph G with n vertices and minimum degree at least h h+1 n contains at least ...
COCOON
2006
Springer
13 years 9 months ago
2006
Springer
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...
JCT
2010
13 years 5 months ago
2010
We prove that for every k and every ε > 0, there exists g such that every graph with tree-width at most k and odd-girth at least g has circular chromatic number at most 2 + ε...
GD
2006
Springer
13 years 11 months ago
2006
Springer
EJC
2008
13 years 7 months ago
2008