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...

This paper characterizes revenue maximizing auctions for a …nite horizon version of the standard IV P model of Myerson (1981) for a seller who cannot commit not to propose a new mechanism, if previously chosen ones fail to allocate the object. We show that a revenue maximizing mechanism in the …rst period assigns the good to the buyer with the highest virtual valuation, provided that it is abov...

In this paper, we explore the effects of certain forbidden substructure conditions on preordered sets. In particular, we characterize in terms of these conditions those preordered sets which can be represented as the supremum of a well-ordered ascending chain of lowersets whose members are constructed by means of alternating applications of disjoint union and ordinal sums with chains. These dec...