Wyniki wyszukiwania

1

2-Tone Colorings in Graph Products

100%

Loe J., Middelbrooks D., Morris A., Wash K.

Discussiones Mathematicae Graph Theory

|

2015

|

tom 35

|

nr 1

55-72

EN

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 for the direct product G×H, the Cartesian product G□H, and the strong product G⊠H.

2

Decision support based methods to facilitate 3D volumetric locking in a new peer to peer based spatial database system

100%

Vert G., Morris A., Heaton J. S.

Control and Cybernetics

|

2006

|

tom 35

|

nr 1

165-194

3

Modeling and manipulating fuzzy regions: strategies to define the topological relation between two fuzzy regions

99%

Schmitz A., Morris A.

Control and Cybernetics

|

2006

|

tom 35

|

nr 1

73-95

Ograniczanie wyników

2 Control and Cybernetics

1 Discussiones Mathematicae Graph Theory

3 Morris A.

1 Heaton J. S.

1 Loe J.

1 Middelbrooks D.

1 Schmitz A.

1 Vert G.

1 Wash K.

1 2015

2 2006

2-Tone Colorings in Graph Products

Decision support based methods to facilitate 3D volumetric locking in a new peer to peer based spatial database system

Modeling and manipulating fuzzy regions: strategies to define the topological relation between two fuzzy regions