4298 search results - page 41 / 860 » Measurable chromatic numbers |
IWOCA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
114
click to vote
ISCAS
1999
IEEE
15 years 6 months ago
1999
IEEE
In this letter, a new class of nonlinear filters called vector median-rational hybrid filters (VMRHF's) for multispectral image processing is introduced and applied to the col...
101
click to vote
DM
2010
15 years 2 months ago
2010
For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour cl...
116
click to vote
DAM
2007
15 years 1 months ago
2007
In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a ...
EJC
2007
15 years 1 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n â...