A proper vertex coloring of a graphG is called a star-coloring if there is no path on four vertices assigned to two colors. The graph G is L-star-colorable if for a given list assignment L there is a star-coloring c such that c(v) ∈ L(v). If G is L-star-colorable for any list assignment L with |L(v)| ≥ k for all v ∈ V (G), then G is called k-star-choosable. The star list chromatic number of G, ...

Objective: Multinodular goiter is a common surgical disease. There no consensus regarding the extent of thyroidectomy for multinodular goiter. This study aims to present personal experience on treating patients with and compare complication rates results total partial goiter.
 Material Method: Three hundred fifty underwent between May 2003 October 2010. All were diagnosed as referred surge...

G iven the high prevalence of coronary artery disease in Western countries, selection of the optimal therapeutic strategy for individual cardiac patients has become an issue of utmost costbenefit importance. During the past two decades, large clinical trials have established the respective roles of medical treatment versus coronary artery bypass surgery in the management of patients with corona...

Suppose that I wish to make a graph G triangle-free by removing a small number of edges. An obvious obstruction is the presence of a large set of edge-disjoint triangles, since I must remove one edge from each triangle. On the other hand, removing all the edges in a maximal set of edge-disjoint triangles clearly makes G triangle-free. Tuza’s Conjecture states that the worstcase number of edges ...

An oriented k-coloring of an oriented graph G is a homomorphism from G to an oriented graph H of order k. We prove that every oriented graph with maximum average degree less than 10 3 has an oriented chromatic number at most 16. This implies that every oriented planar graph with girth at least five has an oriented chromatic number at most 16, that improves the previous known bound of 19 due to ...