منابع مشابه
On colored designs-III: on lambda-colored H-designs, H having lambda edges
Let H be a graph having edges which has no loops and multiple edges. Complete results about the existence of colored designs CH |CK n with exactly colors, are established for 6 4 and for arbitrary when H is a matching or a star. In all cases when there is a design it can be chosen to be cyclic. Slightly less complete results are obtained when H is a path or a cycle. c © 2002 Elsevier Science B....
متن کاملRandomized phase II designs.
As the use of molecularly targeted agents, which are anticipated to increase overall survival (OS)and progression-free survival (PFS) but not necessarily tumor response, has increased in oncology, there has been a corresponding increase in the recommendation and use of randomized phase II designs. Such designs reduce the potential for bias, existent in comparisons with historical controls, but ...
متن کامل06 Drawing Colored Graphs on Colored Points
Let G be a planar graph with n vertices whose vertex set is partitioned into subsets V0, . . . , Vk−1 for some positive integer 1 ≤ k ≤ n and let S be a set of n distinct points in the plane partitioned into subsets S0, . . . , Sk−1 with |Vi| = |Si| (0 ≤ i ≤ k − 1). This paper studies the problem of computing a crossing-free drawing of G such that each vertex of Vi is mapped to a distinct point...
متن کاملDrawing Colored Graphs on Colored Points
Let G be a planar graph with n vertices whose vertex set is partitioned into subsets V0, . . . , Vk−1 for a positive integer 1 ≤ k ≤ n and let S be a set of n distinct points in the plane partitioned into subsets S0, . . . , Sk−1 with |Vi| = |Si| (0 ≤ i ≤ k − 1). This paper studies the problem of computing a crossing-free drawing of G such that each vertex of Vi is mapped to a distinct point of...
متن کاملProduct constructions for cyclic block designs II. Steiner 2-designs
In [4] we introduced a product construction for cyclic Steiner quadruple systems. The purpose of this paper is to modify the construction so that it is applicable to cyclic Steiner 2-designs. A cyclic Steiner 2-design is a Steiner system s(t, k, u), 2 d t < k < u, in which t = 2 and which has an automorphism of order u. We denote such a system by CS(2, k, u). Under suitable conditions we show h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1995
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00199-s