Titlebook: Reviews of Environmental Contamination and Toxicology; George W. Ware Book 1988 Springer-Verlag New York Inc. 1988 Reviews of Environmenta

STEER

Tetrachloroethylene,s, in dry cleaning processes, as a metal degreaser, as an intermediate in the synthesis of certain fluorocarbons, and in the textile industry (Fuller 1976). For the structure and properties of tetrachloroethylene, see Table 1.

languor

最高峰

Trichloroethylene,n industrial solvent and degreaser for metal components. Its structure and properties are listed in Table 1..In 1982 200 million lb (90.72 million kg) of TCE were produced (USITC 1983). The major avenue by which TCE is released to the environment is its use as a metal degreaser. Since TCE is not con

水槽

多嘴多舌

Benzene,have been used as a solvent, but this use has been discontinued. Benzene also is produced indirectly in large volumes, such as during the refining of gasoline and other operations. The average benzene content of gasoline is less than 1% (Run-ion 1975).

A简洁的

蚀刻术

Trichloroethylene, atmosphere. Any TCE that is not lost to evaporation becomes heavily contaminated with grease and oil and is then buried in landfills, dumped on the ground, or put into sewers. Because metals working operations are performed nationwide, TCE releases occur in all industrialized areas. Releases during production and other uses are relatively minor.

假

George W. Wareions. We prove that every graph with vertex-degree at most 6 (at most 3) admits a RAC drawing with curve complexity 2 (resp. 1) and with quadratic area. Third, we consider a natural non-planar generalization of planar embedded graphs. Here we give bounds for curve complexity and area different from

IOTA

George W. Wareive . direction. A directed acyclic graph . has . if . is the minimum integer such that the vertices of . can be ordered by . linear orderings, <.,..., <., and for vertices . and . there is a directed path from . to . if and only if .<.. for all 1 ≤. ≤.. In this note we show that the dimension of th

藕床生厌倦

George W. Wareould not prove the optimality up to now. But the achieved number of bends does not exceed the optimum by more than the optimal number of bends in Tamassia‘s undirected case, i.e. our algorithm needs at most twice the number of bends as necessary in this case.