PURPOSE To determine the mydriatic regimen that provides optimal dilation of the pupil with minimal systemic side effects for screening of retinopathy of prematurity. METHODS This cross-sectional, randomized, double-masked clinical trial compared cyclopentolate 1% + phenylephrine 2.5%, tropicamide 1% + phenylephrine 2.5%, and a prepared combination of cyclopentolate 0.2% with phenylephrine 1%...

Hypoadiponectinemia has been implicated in the development of obesity-related conditions, including dyslipidemia and coronary heart disease (CHD). In this study, the authors examined the association of adiponectin with CHD prevalence, incidence, and mortality among 1,513 community-dwelling men and women aged 50-91 years who were followed from 1984-1987 through 2004. In cross-sectional analyses,...

OBJECTIVE To examine the traditional risk factors and biochemical profile of patients with established CAD (coronary artery disease), and compare the trends of these in specified age groups of different populations as depicted in various studies. METHODOLOGY All consecutive patients below 45 years of age, having classical history of Ischemic heart disease and also having definite ECG changes ...

Copyright resides with the authors in terms of the Creative Commons Attribution 2.5 South African Licence. See: http://creativecommons.org/licenses/by/2.5/za Condition of use: The user may copy, distribute, transmit and adapt the work, but must recognise the authors and the South African Journal of Animal Science. _______________________________________________________________________________...

It is known that every triangle-free (equivalently, of girth at least 4) circle graph is 5-colourable (Kostochka, 1988) and that there exist examples of these graphs which are not 4-colourable (Ageev, 1996). In this note we show that every circle graph of girth at least 5 is 2-degenerate and, consequently, not only 3-colourable but even 3-choosable.

We prove that if two graphs of girth at least 6 have isomorphic squares, then the graphs themselves are isomorphic. This is the best possible extension of the results of Ross and Harary on trees and the results of Farzad et al. on graphs of girth at least 7. We also make a remark on reconstruction of graphs from their higher powers.

Kostochka, A.V., List edge chromatic number of graphs with large girth, Discrete Mathematics 101 (1992) 189-201. It is shown that the list edge chromatic number of any graph with maximal degree A and girth at least 8A(ln A + 1.1) is equal to A + 1 or to A.

He, Hou, Lih, Shao, Wang, and Zhu showed that a planar graph of girth 11 can be decomposed into a forest and a matching. Borodin, Kostochka, Sheikh, and Yu improved the bound on girth to 9. We give sufficient conditions for a planar graph with 3-cycles to be decomposable into a forest and a matching. c © 2008 Elsevier B.V. All rights reserved.

Suzuki (2004) classified thin weakly distance-regular digraphs and proposed the project to classify weakly distance-regular digraphs of valency 3. The case of girth 2 was classified by the third author (2004) under the assumption of the commutativity. In this paper, we continue this project and classify these digraphs with girth more than 2 and two types of arcs.

We consider 2-homogeneous graphs, introduced by Nomura [J. Combin. Theory ser. B 60 (1994)], and discuss the elementary properties. Moreover, the diameter of 2-homogeneous graphs with even girth is bounded, and some restrictions of 2-homogeneous graphs with odd girth are obtained.