Sciweavers

12 search results - page 1 / 3
» On the Acyclic Chromatic Number of Hamming Graphs
Sort
View
GC
2008
Springer
13 years 3 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
ALGORITHMICA
2002
159views more  ALGORITHMICA 2002»
13 years 3 months ago
Algorithmic Aspects of Acyclic Edge Colorings
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
Noga Alon, Ayal Zaks
MP
2010
149views more  MP 2010»
13 years 2 months ago
Copositive programming motivated bounds on the stability and the chromatic numbers
The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...
Igor Dukanovic, Franz Rendl
COCOON
2006
Springer
13 years 7 months ago
Optimal Acyclic Edge Colouring of Grid Like Graphs
We determine the values of the acyclic chromatic index of a class of graphs referred to as d-dimensional partial tori. These are graphs which can be expressed as the cartesian prod...
Rahul Muthu, N. Narayanan, C. R. Subramanian
IWOCA
2009
Springer
157views Algorithms» more  IWOCA 2009»
13 years 10 months ago
Forbidden Subgraph Colorings and the Oriented Chromatic Number
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
N. R. Aravind, C. R. Subramanian