We adapt the classical 3-decomposition of any 2-connected graph to the case of simple graphs (no loops or multiple edges). By analogy with the block-cutpoint tree of a connected graph, we deduce from this decomposition a bicolored tree tc(g) associated with any 2-connected graph g, whose white vertices are the 3-components of g (3-connected components or polygons) and whose black vertices are b...

Let A = fC 1 ; C 2 ; : : : ; C n g be an arrangement of Jordan curves in the plane lying in general position, i.e., every curve properly intersects at least one other curve, no two curves touch each other and no three meet at a common intersection point. The Jordancurve arrangement graph of A has as its vertices the intersection points of the curves in A, and two vertices are connected by an ed...

Given a graph G, let fk be the number of forests of cardinality k in G. Then the sequence (fk) has been conjectured to be unimodal for any graph G. In this paper we confirm this conjecture for Kn and Kn,n by showing that the sequence for Kn is strictly increasing (when n ≥ 4) and the sequence for Kn,n is strictly increasing except for the very last term. As a corollary we also confirm the conje...

In this paper, we study path auction games in which multiple edges may be owned by the same agent. The edge costs and the set of edges owned by the same agent are privately known to the owner of the edges. In this setting, we show that, assuming that edges not on the winning path always get 0 payment, there is no individually rational, strategyproof mechanism in which only edge costs are report...

Abstract We study here systems of distributed entities that can actively modify their communication network. This gives rise to algorithms apart from also exploit network reconfiguration carry out a given task. Also, the task itself may now require global initial $$G_s$$ G s </mml:...

Fix two integers n,k, with n divisible by k, and consider the following game played players, Waiter Client, on edges of Kn. Starting all marked as unclaimed, in each round, picks yet unclaimed edges. Client then chooses one these to be added Client's graph, while other edge is Waiter's graph. wins if she eventually forces create a Kk-factor If does not manage do that, wins. For fixed k large en...

Nepenthes mirabilis is a type of lowland Nepenthes. has morphological variations in size and color its natural habitat. This study was conducted with the aim to determine peat swamp habitat including stems, leaves pitchers. research carried out Pulu Beruang Village, Tulung Selapan District, Ogan Komering Ilir, South Sumatera. The method used exploration method. Determination observation sample ...

A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...

Let H be a graph having edges which has no loops and multiple edges. Complete results about the existence of colored designs CH |CK n with exactly colors, are established for 6 4 and for arbitrary when H is a matching or a star. In all cases when there is a design it can be chosen to be cyclic. Slightly less complete results are obtained when H is a path or a cycle. c © 2002 Elsevier Science B....