12 search results - page 1 / 3» On the Acyclic Chromatic Number of Hamming Graphs |

GC

2008

Springer

13 years 11 months ago
2008

Springer

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...

ALGORITHMICA

2002

13 years 11 months ago
2002

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...

MP

2010

13 years 9 months ago
2010

The Lov´asz theta number of a graph G can be viewed as a semideﬁnite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...

COCOON

2006

Springer

14 years 2 months ago
2006

Springer

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...

IWOCA

2009

Springer

14 years 5 months ago
2009

Springer

: 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...