836 search results - page 44 / 168 » Orthogonal Colorings of Graphs |
110
Voted
APAL
1998
15 years 1 months ago
1998
A recursive graph is a graph whose vertex and edges sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively det...
105
Voted
COMBINATORICS
2000
15 years 1 months ago
2000
In this paper we consider the problem of establishing a value r0 such that almost all random graphs with n vertices and rn edges, r > r0, are asymptotically not 3-colorable. In...
99
Voted
IPL
1998
15 years 1 months ago
1998
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exis...
94
Voted
IMAGING
2004
15 years 3 months ago
2004
: A psychophysical experiment was performed to measure the visibility of chromatic noise. Through Principle Component Analysis (PCA) on the results of this experiment, an orthogona...
99
Voted
ICAT
2007
IEEE
15 years 8 months ago
2007
IEEE
This study concerns the development of 3D interfaces that aid the navigation of large data structures through the usage of the HSV color space, and the ensuing “spatial framesâ€...