Modeling and manipulating fuzzy regions: strategies to define the topological relation between two fuzzy regions
Decision support based methods to facilitate 3D volumetric locking in a new peer to peer based spatial database system
2-Tone Colorings in Graph Products
A variation of graph coloring known as a t-tone k-coloring assigns a set of t colors to each vertex of a graph from the set {1, . . . , k}, where the sets of colors assigned to any two vertices distance d apart share fewer than d colors in common. The minimum integer k such that a graph G has a t- tone k-coloring is known as the t-tone chromatic number. We study the 2-tone chromatic number in three different graph products. In particular, given graphs G and H, we bound the 2-tone chromatic number...
Page 1