✦ LIBER ✦

On the Acyclic Chromatic Number of Hamming Graphs

✍ Scribed by Robert E. Jamison; Gretchen L. Matthews

Publisher: Springer Japan
Year: 2008
Tongue: English
Weight: 160 KB
Volume: 24
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-008-0798-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Acyclic edge chromatic number of outerpl

Acyclic edge chromatic number of outerplanar graphs

✍ Jian-Feng Hou; Jian-Liang Wu; Gui-Zhen Liu; Bin Liu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB

## Abstract A proper edge coloring 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 χ(__G__), is the least number of colors in an acyclic edge coloring of __G__. In this paper, we determine completely the acyclic edge

Acyclic and oriented chromatic numbers o

Acyclic and oriented chromatic numbers of graphs

✍ Kostochka, A. V.; Sopena, E.; Zhu, X. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB 👁 2 views

The oriented chromatic number χ o ( G) of an oriented graph G = (V, A) is the minimum number of vertices in an oriented graph H for which there exists a homomorphism of G to H. The oriented chromatic number χ o (G) of an undirected graph G is the maximum of the oriented chromatic numbers of all the

Bounds on the Generalised Acyclic Chroma

Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs

✍ Catherine Greenhill; Oleg Pikhurko 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 143 KB

The generalized acyclic edge chromatic n

The generalized acyclic edge chromatic number of random regular graphs

✍ Stefanie Gerke; Catherine Greenhill; Nicholas Wormald 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB 👁 1 views

## Abstract The __r__‐acyclic edge chromatic number of a graph is defined to be the minimum number of colors required to produce an edge coloring of the graph such that adjacent edges receive different colors and every cycle __C__ has at least min(|__C__|, __r__) colors. We show that (__r__ − 2)__d

Acyclic graph coloring and the complexit

Acyclic graph coloring and the complexity of the star chromatic number

✍ David R. Guichard 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB

## Abstract Star chromatic number, introduced by A. Vince, is a natural generalization of chromatic number. We consider the question, “When is χ\* < χ?” We show that χ\* < χ if and only if a particular digraph is acyclic and that the decisioin problem associated with this question is probably not i

On the chromatic number of disk graphs

✍ Malesi?ska, Ewa; Piskorz, Steffen; Wei�enfels, Gerhard 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB 👁 2 views

Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their