4298 search results - page 25 / 860 » Measurable chromatic numbers |
ALGORITHMICA
2010
13 years 5 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...
JGT
2010
13 years 5 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...
16
Voted
IMAGING
2001
13 years 8 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...
CIMCA
2005
IEEE
13 years 9 months ago
2005
IEEE
WG
2005
Springer
14 years 26 days ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...