PURPOSE To evaluate variations in the position of the phakic iris claw lens (Artisan, Verisyse) and the natural crystalline lens during the accommodation process. METHODS We measured changes in position of the iris claw lens and the crystalline lens during the accommodation using optical coherence biometry (AC Master/Carl Zeiss Meditec, Germany) in 17 patients (28 eyes) with a phakic iris cla...

Over-the-Scope Clip system, also called "Bear Claw," is a novel endoscopic modality used for closure of gastrointestinal defect with high efficacy and safety. We present a patient with history of eosinophilic gastroenteritis and multiple abdominal surgeries including Billroth II gastrectomy complicated by a large chronic duodenocutaneous fistula from a Billroth II afferent limb to the abdominal...

Let G be a claw-free graph and let cl(G) be the closure of G. We present a method for characterizing classes G i , i = 3; : : : ; 7, of 2-connected closed claw-free graphs with the following properties.

We characterise the class of all claw-free t-perfect graphs by forbidden t-minors. Moreover, we show that claw-free t-perfect graphs are 3-colourable. Such a colouring can be obtained in polynomial time.

Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. In an earlier paper we characterized claw-free cubic graphs and derived a recurrence relation for Hn. Here

A graph G is Nm-locally connected if for every vertex v in G, the vertices not equal to v and with distance at most m to v induce a connected subgraph in G. We show that both connected N2-locally connected claw-free graph and 3-edge-connected N3-locally connected claw-free graph have connected even [2, 4]-factors, which settle a conjecture by Li in [6].

It is shown that every 3-connected claw-free graph having at most 6 − 7 vertices is hamiltonian, where is the minimum degree. c © 2002 Elsevier Science B.V. All rights reserved.

It is proven that if G is a 3-connected claw-free graph which is also Z3-free (where Z3 is a triangle with a path of length 3 attached), P6-free (where P6 is a path with 6 vertices) or H1-free (where H1 consists of two disjoint triangles connected by an edge), then G is hamiltonian-connected. Also, examples will be described that determine a finite family of graphs L such that if a 3-connected ...

Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [9,14] and claw-free graphs [8,9]. Providing a decent linear description of the stable set polytopes of claw-free graphs is a long-standing problem [10]. However, even the problem of finding all facets of stable set polytopes of webs is open. So far,...