Acyclic and k-distance coloring of the grid
نویسندگان
چکیده
منابع مشابه
Acyclic and k-distance coloring of the grid
In this paper, we give a relatively simple though very efficient way to color the d-dimensional grid G(n1, n2, . . . , nd) (with ni vertices in each dimension 1 i d), for two different types of vertex colorings: (1) acyclic coloring of graphs, in which we color the vertices such that (i) no two neighbors are assigned the same color and (ii) for any two colors i and j , the subgraph induced by t...
متن کاملOn Acyclic Vertex Coloring of Grid like graphs
d-dimensional partial tori are graphs that can be expressed as cartesian product of d graphs each of which is an induced path or cycle. Some well known graphs like d-dimensional hypercubes, meshes and tori are examples belong to this class. Muthu et al.[MNS06] have studied the problem of acyclic edge coloring for such graphs. We try to explore the acyclic vertex coloring problem for these graph...
متن کاملAcyclic Coloring of Graphs
A vertex coloring of a graph G is called acyclic if no two adjacent vertices have the same color and there is no two-colored cycle in G. The acyclic chromatic number of G , denoted by A ( G ) , is the least number of colors in an acyclic coloring of G. We show that if G has maximum degree d, then A ( G ) = O(d413) as d+m. This settles a problem of Erdos who conjectured, in 1976, that A ( G ) = ...
متن کاملAcyclic Coloring of Graphs
Coloring is an abstraction for partitioning a set of objects into a few independent sets. The notion of independence and the associated coloring rules vary from context to context. In the simplest case, adjacent vertices in a graph are required to receive different colors ( proper coloring). In parallel scientific computing, a proper coloring is used to identify computational subtasks that can ...
متن کاملAcyclic Coloring of Graphs
In this report we obtain (good) upper bounds on the acyclic chromatic index of graphs obtained as the tensor product of two (or more) graphs, in terms of the acyclic chromatic indices of those factor graphs in the tensor product. Our results assume that optimal colourings for the factor graphs are given and our algorithms extend these colourings to obtain good (close to optimal) colourings of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2003
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(03)00232-1