12 search results - page 2 / 3 » On the Acyclic Chromatic Number of Hamming Graphs |
101
Voted
AAIM
2007
Springer
15 years 5 months ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
107
Voted
JGT
2008
14 years 11 months ago
2008
: This article proves the following result: Let G and G be graphs of orders n and n , respectively. Let G be obtained from G by adding to each vertex a set of n degree 1 neighbors....
106
Voted
CORR
2011
Springer
14 years 6 months ago
2011
Springer
An acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees. The more restricted notion of star ...
89
Voted
JGT
2008
14 years 11 months ago
2008
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
94
Voted
DM
2011
14 years 6 months ago
2011
An acyclic vertex coloring of a graph is a proper vertex coloring such that there are no bichromatic cycles. The acyclic chromatic number of G, denoted ...