β Scribed by J. R. Brown
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we study the optimum cost chromatic partition OCCP problem for several graph classes. The OCCP problem is the problem of coloring the vertices of a graph such that adjacent vertices get different colors and that the total coloring cost is minimum. We prove several approximation result
## Abstract The chromatic neighborhood sequence of a graph G is the list of the chromatic numbers of the subgraphs induced by the neighborhoods of the vertices. We study the maximum multiplicity of this sequence, proving, amongst other things, that if a chromatic neighborhood sequence has __t__ dis
## Abstract Resting cells of __Desulfovibrio vulgaris__ NCIMB 8303 and __Desulfovibrio desulfuricans__ NCIMB 8307 were used for the hydrogenaseβmediated reduction of Pd(II) to Pd(0). The resulting hybrid palladium bionanocatalyst (BioβPd(0)) was used in the reduction of Cr(VI) to the less environme