We introduce nite relational structures called sketches, that represent edge crossings in drawings of nite graphs. We consider the problem of characterizing sketches in Monadic Second-Order logic. We answer positively the question for framed sketches, i.e., for those representing drawings of graphs consisting of a planar connected spanning subgraph (the frame) augmented with additional edges th...

Let c : E(G) → [k] be an edge-coloring of a graph G, not necessarily proper. For each vertex v, let c̄(v) = (a1, . . . , ak), where ai is the number of edges incident to v with color i. Reorder c̄(v) for every v in G in nonincreasing order to obtain c∗(v), the color-blind partition of v. When c∗ induces a proper vertex coloring, that is, c∗(u) 6= c∗(v) for every edge uv in G, we say that c is col...

Reflexive methodology was used to identify music collectors’ needs, that informed the development of conceptual prototypes which create moments of delightful distraction in their everyday lives. ARON: music lives in the cloud is a music listening and sharing system that enables ambient, non-task oriented experiences through networked biomorphic light forms equipped with a presence interface. AR...

Prior studies on online sentence processing have shown that the parser can resolve non-local dependencies rapidly and accurately. This study investigates the interaction between the processing of two such non-local dependencies: wh-filler-gap dependencies (WhFGD) and reflexive-antecedent dependencies. We show that reflexive-antecedent dependency resolution is sensitive to the presence of a WhFG...

We examine the simultaneous embedding with fixed edges problem for two planar graphs G1 and G2 with the focus on their intersection S = G1∩G2. In particular, we will present the complete set of intersection graphs S that guarantee a simultaneous embedding with fixed edges for (G1, G2). More formally, we define the subset ISEFE of all planar graphs as follows: A graph S lies in ISEFE if every pa...

We prove that the unique decomposition of connected graphs defined by Tutte is definable by formulas of Monadic Second-Order Logic. This decomposition has two levels: every connected graph is a tree of "2-connected components" called blocks ; every 2-connected graph is a tree of so-called 3-blocks. Our proof uses 2dags which are certain acyclic orientations of the considered graphs. We obtain a...

The rank-width is a graph parameter related in terms of fixed functions to cliquewidth but more tractable. Clique-width has nice algorithmic properties, but no good “minor” relation is known analogous to graph minor embedding for tree-width. In this paper, we discuss the vertex-minor relation of graphs and its connection with rank-width. We prove a relationship between vertex-minors of bipartit...

..........................................................................................iii Table of contents.................................................................................iv List of Figures.................................................................................viii List of Tables......................................................................................x...

We prove that the dual or any quotient of a separable reflexive Banach space with the unconditional tree property has the unconditional tree property. This is used to prove that a separable reflexive Banach space with the unconditional tree property embeds into a reflexive Banach space with an unconditional basis. This solves several long standing open problems. In particular, it yields that a ...