Sciweavers

7 search results - page 1 / 2
» On the chromatic number of integral circulant graphs
Sort
View
DM
2008
116views more  DM 2008»
13 years 5 months ago
Total and fractional total colourings of circulant graphs
In this paper, the total chromatic number and fractional total chromatic number of circulant graphs are studied. For cubic circulant graphs we give upper bounds on the fractional ...
Riadh Khennoufa, Olivier Togni
CMA
2010
73views more  CMA 2010»
13 years 2 months ago
On the chromatic number of integral circulant graphs
Aleksandar Ilic, Milan Basic
JGT
2010
103views more  JGT 2010»
13 years 3 months ago
Proof of a conjecture on fractional Ramsey numbers
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...
Jason Brown, Richard Hoshino
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 5 months ago
Quadratic forms on graphs
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
Noga Alon, Konstantin Makarychev, Yury Makarychev,...
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 6 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani