A connected edge-colored graphG is said to be rainbow-connected if any two distinct vertices of G are connected by a path whose edges have pairwise distinct colors, and the rainbow connection number rc(G) ofG is the minimum number of colors that can make G rainbow-connected. We consider families F of connected graphs for which there is a constant kF such that every connected F-free graph G with...

Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most skew lattices of interest are categorical, not all are. They are characterized by a countable family of forbidden subalgebras. We also consider the subclass of strictly categorical skew lattices.

We characterize graphs that have intersection representations using unit intervals with open or closed ends such that all ends of the intervals are integral in terms of infinitely many minimal forbidden induced subgraphs. Furthermore, we provide a quadratic-time algorithm that decides if a given interval graph admits such an intersection representation.

An undirected graph G = (V, E) is a probe split graph if its vertex set can be partitioned into two sets, N (nonprobes) and P (probes) where N is independent and there exists E′ ⊆ N ×N such that G′ = (V, E ∪ E′) is a split graph. Recently Chang et al. gave an O(V (V +E)) time recognition algorithm for probe split graphs. In this article we give O(V 2 +V E) time recognition algorithms and charac...

A method for recognition of Persian handwritten digits based on characterization loci and mixture of experts is proposed. This method utilizes the characterization loci, as the main feature. In the classification stage of our proposed method the mixture of experts are applied. This recognition method is applied to Farsi hand-written digits in the HODA database. The experimental results support ...

Recently Postnikov gave a combinatorial description of the cells in a totallynonnegative Grassmannian. These cells correspond to a special class of matroids called positroids. We prove his conjecture that a positroid is exactly an intersection of permuted Schubert matroids. This leads to a combinatorial description of positroids that is easily computable. The main proof is purely combinatorial,...

In algebraic language theory one investigates formal languages by relating them to finite algebras. The most important result along these lines is Eilenberg’s celebrated variety theorem [7]: varieties of languages (classes of regular finite-word languages closed under boolean operations, derivatives and preimages of monoid morphisms) correspond bijectively to pseudovarieties of monoids (classes...

545 Acta Endocrinologica (Buc), vol. X, no. 4, p. 545-558, 2014 *Correspondence to: Daniel Boda MD, PhD, “Carol Davila” University of Medicine and Pharmacy Dermatology Research Laboratory, 22-24 Gr. Manolescu, Sector 1, Bucharest, 0111234, Romania, E-mail: [email protected] Abstract Context. Melanoma is the most aggressive skin cancer, with significant morbidity and mortality, and one facto...

Coupled oscillators are shown to experience two structurally different oscillation quenching types: amplitude death (AD) and oscillation death (OD). We demonstrate that both AD and OD can occur in one system and find that the transition between them underlies a classical, Turing-type bifurcation, providing a clear classification of these significantly different dynamical regimes. The implicatio...

The authors propose "decreased-dose-intensity" PCV (procarbazine, lomustine [CCNU], and vincristine) chemotherapy for Asian patients with oligodendroglial tumors. In this study, all seven patients with oligodendroglioma (OD) and eight with anaplastic oligodendroglioma (AO) had objective responses or stable disease. Median progression-free survival was greater than 29 months (OD) and 36.5 months...