An edge coloring of a graph G is called Mi-edge coloring if at most i colors appear at any vertex of G. Let Ki(G) denote the maximum number of colors used in an Mi-edge coloring of G. In this paper we determine the exact value of K2(G) for any graph G of maximum degree at most 3. Mathematics Subject Classification: 05C15, 05C38

Objective(s): Despite several proposed mechanisms for the pathophysiology of cardiorenal syndrome (CRS), the exact mechanism remains unclear. Nitrosative stress has been argued as a key mechanism recently. Nebivolol is a beta-blocker with nitric oxide (NO)-releasing effect. In the present study, NO-mediated effects of two different treatment regimes of nebivolol in CRS...

introduction: several studies have shown the independent association of high plasma c - reactive protein (crp) levels with adverse prognosis in patients with acute myocardial infarction (mi). the aim of this study was to assess the prognostic value of quantitative crp (q-crp) to predict mi in patients with unstable angina. materials & methods: this cohort study was carried out between december ...

introduction: previous studies have shown that various factors such as emotional stress can trigger of mi in susceptible persons. more studies are needed to evaluate the characteristics of patients regarding to emotional stress, heavy work, routine activity, infection or rest before occurrence of mi. methods: we studied 608 consecutive hospitalized in ccus from may 2000 to october 2001. for pat...