940 resultados para Graph Decomposition


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Bibliography: pt. 1, p. 37-38.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

v.I. Introduction. Alcohols, neutral alcoholic derivatives, sugars, starch and its isomers, vegetable acids, etc. 2d ed., rev. & enl.--v.II. Fixed oils, fats, waxes, glycerol, nitroglycerin and nitroglycerin explosives. Hydrocarbons, petroleum and coal-tar products, asphalt, phenols and creosotes. 2d ed., rev. & enl.--v. III, pt.I. Acid derivatives of phenols, aromatic acids, resins, and essential oils. Tannins, dyes, and colouring matters, writing inks. 2d ed., rev. & enl.--v. III, pt.II. Amines and ammonium bases, hydrarzines, bases from tar, vegetable alkaloids. 2d ed., rev. and enl. [1892] --v.III, pt.III. Vegetable alkaloids (concluded), non-basic vegetable bitter principles, animal bases, animal acids, cyanogen and its derivatives. 2d ed., rev. & enl. [1896]--v.IV. Proteids and albuminous principles, proteoïds or albuminoïds. 2d ed., rev. & enl. 1898.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

From Philosophical transactions for 1808, v. 98, p. 1-44, 341-346.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Thesis (doctoral)--

Relevância:

20.00% 20.00%

Publicador:

Resumo:

At head of title : Generalized computer program.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

At head of cover title : Generalized computer program.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Thesis (Ph.D.)--University of Washington, 2016-06

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Thesis (Ph.D.)--University of Washington, 2016-06

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Thesis (Ph.D.)--University of Washington, 2016-06

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A cube factorization of the complete graph on n vertices, K-n, is a 3-factorization of & in which the components of each factor are cubes. We show that there exists a cube factorization of & if and only if n equivalent to 16 (mod 24), thus providing a new family of uniform 3 -factorizations as well as a partial solution to an open problem posed by Kotzig in 1979. (C) 2004 Wiley Periodicals, Inc.

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A K-t,K-t-design of order n is an edge-disjoint decomposition of K-n into copies of K-t,K-t. When t is odd, an extended metamorphosis of a K-t,K-t-design of order n into a 2t-cycle system of order n is obtained by taking (t - 1)/2 edge-disjoint cycles of length 2t from each K-t,K-t block, and rearranging all the remaining 1-factors in each K-t,K-t block into further 2t-cycles. The 'extended' refers to the fact that as many subgraphs isomorphic to a 2t-cycle as possible are removed from each K-t,K-t block, rather than merely one subgraph. In this paper an extended metamorphosis of a K-t,K-t-design of order congruent to 1 (mod 4t(2)) into a 2t-cycle system of the same order is given for all odd t > 3. A metamorphosis of a 2-fold K-t,K-t-design of any order congruent to 1 (mod 4t(2)) into a 2t-cycle system of the same order is also given, for all odd t > 3. (The case t = 3 appeared in Ars Combin. 64 (2002) 65-80.) When t is even, the graph K-t,K-t is easily seen to contain t/2 edge-disjoint cycles of length 2t, and so the metamorphosis in that case is straightforward. (C) 2004 Elsevier B.V. All rights reserved.