In a recently submitted paper we obtained an upper bound for the minimum number of components of a 2-factor in a claw-free graph. This bound is sharp in the sense that there exist infinitely many claw-free graphs for which the bound is tight. In this paper we extend these results by presenting a polynomial algorithm that constructs a 2-factor of a claw-free graph with minimum degree at least fo...

The only available combinatorial algorithm for the minimum weighted clique cover (mwcc) in claw-free perfect graphs is due to Hsu and Nemhauser [10] and dates back to 1984. More recently, Chudnovsky and Seymour [3] introduced a composition operation, strip-composition, in order to define their structural results for claw-free graphs; however, this composition operation is general and applies to...

A graph G is said to be claw-free if G has no induced subgraph isomorphic to K1,3. For a cycle C in a graph G, C is called a Tutte cycle of G if C is a Hamilton cycle of G, or the order of C is at least 4 and every component of G − C has at most three neighbors on C. In [On a closure concept in claw-free graphs, J. Combin. Theory Ser. B 70 (1997), 217–224], Ryjáček proved that the conjectures b...

We give a simple algorithm for the weighted stable set problem of an arbitrary graph which yields an extended formulation for its stable set polytope The algorithm runs in polynomial time for the class of distance claw free graphs These are the graphs such that for each node neither its neighbour set nor the set of nodes at distance two contain a stable set of size three The extended formulatio...

The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs form a superclass of perfect graphs defined by means of this more general coloring concept. This paper studies claw-free circular-perfect graphs. First we prove that ifG is a connected claw-free circular-perfect graph with χ(G) > ω(G), then min{α(G), ω(G)} = 2. We use this resu...

In 2006 Barát and Thomassen conjectured that every planar 4-edge-connected 4-regular simple graph of size divisible by three admits a claw-decomposition. Later, Lai (2007) disproved this conjecture family graphs with edge-connectivity 4 which the smallest one contains 24 vertices. note, we first give smaller counterexample having only 18 vertices next construct 4-connected essentially 6-edge-co...

We show that the class of chordal claw-free graphs admits LREC=-definable canonization. LREC= is a logic that extends first-order logic with counting by an operator that allows it to formalize a limited form of recursion. This operator can be evaluated in logarithmic space. It follows that there exists a logarithmic-space canonization algorithm, and therefore a logarithmic-space isomorphism tes...

A study was conducted to appraise the effect of different stocking densities on three male morphotypes named blue claw (BC), orange claw (OC) and small male (SM) at harvest  in all-male culture and to assess the growth performance of  BC, OC and SM in each isolated culture. Trials involving three stocking densities of all-male prawn viz., 20, 30 and 40 juvenile m-2 were carried out in replicate...

The woody Amazonian vine Uncaria tomentosa (cat's claw) has been recently more and more popular all over the world as an immunomodulatory, antiinflammatory and anti-cancer remedy. This study investigates anti-proliferative potency of several cat's claw preparations with different quantitative and qualitative alkaloid contents on HL-60 acute promyelocytic human cells by applying trypan blue excl...

In this paper, we show that every 3-connected claw-free graph G has a 2-factor having at most max { 2 5(α+1), 1 } cycles, where α is the independence number of G. As a corollary of this result, we also prove that every 3-connected claw-free graph G has a 2-factor with at most ( 4|G| 5(δ+2)+ 2 5 ) cycles, where δ is the minimum degree of G. This is an extension of a known result on the number of...