Nachweisung freien Schwefels

Ohne Zusammenfassung     

On Hamilton decompositions of prisms over simple 3-polytopes

In this paper it is shown that certain families of simple 4-polytopes have a Hamilton decomposition, that is, the edges of these polytopes can be partitioned into two Hamilton cycles.This research was partially supported by N.S.E.R.C. under Grant A-4792.     

Compression and reconstruction of MRI images using 2D DCT.

In magnetic resonance imaging (MRI), the original data are sampled in the spatial frequency domain. The sampled data thus constitute a set of discrete Fourier transform (DFT) coefficients. The image is usually reconstructed by taking inverse DFT. The image data may then be compressed using the discrete cosine transform (DCT). We present here a method of treating the data that combines two procedures, image reconstruction and data compression. This method may be particularly useful in medical picture archiving and communication systems (PACS) where both image reconstruction and compression are important issues.     

Hamilton cycles in prisms

The prism over a graph G is the Cartesian product G □ K₂ of G with the complete graph K₂. If G is hamiltonian, then G□K₂ is also hamiltonian but the converse does not hold in general. Having a hamiltonian prism is shown to be an interesting relaxation of being hamiltonian. In this article, we examine classical problems on hamiltonicity of graphs in the context of having a hamiltonian prism. © 2007 Wiley Periodicals, Inc. J Graph Theory 56: 249–269, 2007