Let V be a set of cardinality v (possibly infinite). Two graphsG and G with vertex set V are isomorphic up to complementation if G is isomorphic to G or to the complement G of G. Let k be aâ€¦ (More)

Let G := (V,E) be a simple graph; for I âŠ† V we denote by l(I) the number of components of G[I], the subgraph of G induced by I. For V1, . . . , Vn finite subsets of V , we define a function Î²(V1, . .â€¦ (More)

Mailbox Abstract We describe F orb{K 1,3 , K 1,3 }, the class of graphs G such that G and its complement G are claw-free. With few exceptions, it is made of graphs whose connected components consistâ€¦ (More)

We describe Forb{K1,3, K1,3}, the class of graphs G such that G and its complement G are claw-free. With few exceptions, it is made of graphs whose connected components consist of cycles of length atâ€¦ (More)

Considering uniform hypergraphs, we prove that for every non-negative integer h there exist two non-negative integers k and t with k â‰¤ t such that two h-uniform hypergraphs H and Hâ€² on the same set Vâ€¦ (More)

Necrotizing fasciitis (N.F.) is a rare but serious infection of subcutaneous tissues and deep fascia with resulting skin gangrene and septicaemia. It is due to mixed anaerobic and aerobic organisms.â€¦ (More)