1302 search results - page 26 / 261 » On the Strong Chromatic Number |
159
click to vote
JCO
2007
15 years 6 months ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
128
click to vote
DM
1998
15 years 5 months ago
1998
We characterize the edge-signed graphs in which every 'significant' positive closed walk (or combination of walks) has even length, under seven different criteria for si...
197
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
160
click to vote
JGT
2010
15 years 4 months ago
2010
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...
139
click to vote
IMAGING
2001
15 years 7 months ago
2001
In this paper, we present a spherical sampling technique that can be employed to find optimal sensors for trichromatic color applications. The advantage over other optimization te...