We prove that claw-free graphs, containing an induced dominating path, have a Hamiltonian path, and that 2-connected claw-free graphs, containing an induced doubly dominating cycle or a pair of vertices such that there exist two internally disjoint induced dominating paths connecting them, have a Hamiltonian cycle. As a consequence, we obtain linear time algorithms for both problems if the inpu...

Chudnovsky and Seymour proved that every connected claw-free graph that contains a stable set of size 3 has chromatic number at most twice its clique number. We improve this for small clique size, showing that every claw-free graph with clique number at most 3 is 4-choosable and every claw-free graph with clique number at most 4 is 7-choosable. These bounds are tight.

Iris varix as a cause of late-onset inflammation after implantation of a phakic iris claw lens Iris varix as a cause of late-onset inflammation after implantation of a phakic iris claw lens.

purpose: to evaluate the predictability, efficacy, and safety of iris-claw artisanô phakic intraocular lenses ­for myopia. methods: through a prospective clinical study, 35 eyes of 21 patients with myopia from -5 to 26.5 diopters underwent implantation of the artisan lens. patients were examined 1, 3, and 7 days (all eyes); 1 month (28 eyes), 3 months (29 eyes), and 6 months (32 eyes) after the...

Article history: Received 7 May 2010 Received in revised form 13 September 2010 Accepted 18 September 2010 Claw lesions in lactating sows on 3 commercial farms were assessed in 6 areas of each of a sow's 8 claws to investigate the relationship between claw lesions and stage of lactation. In addition, the relationships between claw lesions and postural behavior, reproductive performance or culli...

A claw-free graph G(V,E) is said to be basic if there exists a matching M ⊆ E whose edges are strongly bisimplicial and such that each connected component C of G − M is either a clique or a {claw, net}-free graph or satisfies α(G[C \ V (M)]) ≤ 3. The Maximum Weight Stable Set (MWSS) Problem in a basic claw-free graph can be easily solved by first solving at most four MWSS problems in each conne...

BACKGROUND In order to facilitate normal gait, toes require to be in a rectus position during the propulsive phase. This requires a correct balance and sequence of activity of the intrinsic musculature of the feet. Alteration of this balance and sequence may lead to the development of claw toes. Atrophy of the lumbricals occurs in the development of claw toes, but it is not known if changes occ...

Let G be a graph with |V (G)| ≥ 10. We prove that if both G and G are claw-free, then min{∆(G), ∆(G)} ≤ 2. As a generalization of this result in the case where |V (G)| is sufficiently large, we also prove that if both G and G are K1,t-free, then min{∆(G), ∆(G)} ≤ r(t− 1, t)− 1 where r(t− 1, t) is the Ramsey number.

We prove that every claw-free graph G that does not contain a clique on ∆(G) ≥ 9 vertices can be ∆(G)− 1 colored.

A graph is called t-perfect if its stable set polytope is defined by nonnegativity, edge and odd-cycle inequalities. We show that it can be decided in polynomial time whether a given claw-free graph is t-perfect.