Given a graph G = (V; E), the metric polytope S(G) is deened by the inequalities x(F) ? x(C n F) jFj ? 1 for F C; jFj odd ; C cycle of G, and 0 x e 1 for e 2 E. Optimization over S(G) provides an approximation for the max-cut problem. The graph G is called 1 d-integral if all the vertices of S(G) have their coordinates in f i d j 0 i dg. We prove that the class of 1 d-integral graphs is closed ...

The objective of this study was to establish the optimum protocol for the isolation and culture of porcine muscle satellite cells. Mononuclear muscle satellite cells are a kind of adult stem cell, which is located between the basal lamina and sarcolemma of muscle fibers and is the primary source of myogenic precursor cells in postnatal muscle. Muscle satellite cells are a useful model to invest...

Accurate characterization of promoter behavior is essential for the rational design of functional synthetic transcription networks such as logic gates and oscillators. However, transcription rates observed from promoters can vary significantly depending on the growth rate of host cells and the experimental and genetic contexts of the measurement. Furthermore, in vivo measurement methods must ac...

Let fvs(G) and cfvs(G) denote the cardinalities of a minimum feedback vertex set and a minimum connected feedback vertex set of a graph G, respectively. For a graph class G, the price of connectivity for feedback vertex set (poc-fvs) for G is defined as the maximum ratio cfvs(G)/fvs(G) over all connected graphs G in G. It is known that the poc-fvs for general graphs is unbounded. We study the p...

Group-IV nanocrystals have emerged as a promising group of materials that extends the realm of application of bulk diamond, silicon, germanium and related materials beyond their traditional boundaries. Over the last two decades of research, their potential for application in areas such as optoelectronic applications and memory devices has been progressively unraveled. Nevertheless, new challeng...

We characterize all pairs of connected graphs {X,Y } such that each 3-connected {X,Y }-free graph is pancyclic. In particular, we show that if each of the graphs in such a pair {X,Y } has at least four vertices, then one of them is the claw K1,3, while the other is a subgraph of one of six specified graphs.

A circular-arc model (C,A) is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then (C,A) is a Helly circular-arc model. A (Helly) circular-arc graph is the intersection graph of a (Helly) circular-arc model. Circular-arc graphs and their subclasses have been the object of a great deal of attention, in the literature. Linear time recognition algorithm have...

We discuss the use of K-terminal networks to represent arbitrary clutters. A given clutter has many di¤erent representations, and there does not seem to be any set of simple transformations that can be used to transform one representation of a clutter into any other. We observe that for t 2 the class of clutters that can be represented using no more than t terminals is closed under minors, and ...

A generalized Davenport-Schinzel sequence is one over a finite alphabet that contains no subsequences isomorphic to a fixed forbidden subsequence. One of the fundamental problems in this area is bounding (asymptotically) the maximum length of such sequences. Following Klazar, let Ex(σ, n) be the maximum length of a sequence over an alphabet of size n avoiding subsequences isomorphic to σ. It ha...

Reservoir characterization This paper gives an overview of the activities in geostatistics for the Petroleum industry in the domain of reservoir characterization. This description has been simplified in order to emphasize the original techniques involved. The main steps of a study consist in successively building: • the reservoir architecture where the geometry of the units is established, • th...