On chordal and bilateral SLE in multiply connected domains

We discuss the possible candidates for conformally invariant random non-self-crossing curves which begin and end on the boundary of a multiply connected planar domain, and which satisfy a Markovian-type property. We consider both, the case when the curve connects a boundary component to itself (chordal), and the case when the curve connects two different boundary components (bilateral). We establish appropriate extensions of Loewner’s equation to multiply connected domains for the two cases. We show that a curve in the domain induces a motion on the boundary and that this motion is enough to first recover the motion of the moduli of the domain and then, second, the curve in the interior. For random curves in the interior we show that the induced random motion on the boundary is not Markov if the domain is multiply connected, but that the random motion on the boundary together with the random motion of the moduli forms a Markov process. In the chordal case, we show that this Markov process satisfies Brownian scaling and discuss how this limits the possible conformally invariant random non-self-crossing curves. We show that the possible candidates are labeled by two functions, one homogeneous of degree zero, the other homogeneous of degree minus one, which describes the interaction of the random curve with the boundary. We show that the random curve has the locality property for appropriate choices of the interaction term. The research of the first author was supported by NSA grant H98230-04-1-0039. The research of the second author was supported by a grant from the Max-Planck-Gesellschaft.     

Cohen-Macaulay chordal graphs

We classify all Cohen-Macaulay chordal graphs. In particular, it is shown that a chordal graph is Cohen-Macaulay if and only if it is unmixed.     

Centers of chordal graphs

In a graphG = (V, E), theeccentricity e(S) of a subset S ismax _{x V} min _{y S} d(x, y); ande(x) stands fore({x}). Thediameter ofG ismax _{x V} e(x), theradius r(G) ofG ismin _{x V} e(x) and theclique radius cr(G) ismin e(K) whereK runs over all cliques. Thecenter ofG is the subgraph induced byC(G), the set of all verticesx withe(x) = r(G). Aclique center is a cliqueK withe(K) = cr(G). In this paper, we study the problem of determining the centers of chordal graphs. It is shown that the center of a connected chordal graph is distance invariant, biconnected and of diameter no more than 5. We also prove that2cr(G) d(G) 2cr(G) + 1 for any connected chordal graphG. This result implies a characterization of a biconnected chordal graph of diameter 2 and radius 1 to be the center of some chordal graph.Supported by the National Science Council of the Republic of China under grant NSC77-0208-M008-05     

Polarity of chordal graphs

Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NP-complete to decide for general graphs. It has been recently proved that for cographs, the existence of such a partition can be characterized by finitely many forbidden subgraphs, and hence tested in polynomial time. In this paper we address the question of polarity of chordal graphs, arguing that this is in essence a question of colourability, and hence chordal graphs are a natural restriction. We observe that there is no finite forbidden subgraph characterization of polarity in chordal graphs; nevertheless we present a polynomial time algorithm for polarity of chordal graphs. We focus on a special case of polarity (called monopolarity) which turns out to be the central concept for our algorithms. For the case of monopolar graphs, we illustrate the structure of all minimal obstructions; it turns out that they can all be described by a certain graph grammar, permitting our monopolarity algorithm to be cast as a certifying algorithm.     

Learning chordal extensions

Journal of Global Optimization - A highly influential ingredient of many techniques designed to exploit sparsity in numerical optimization is the so-called chordal extension of a graph...     

Maximal chordal subgraphs

An algorithm for finding maximal chordal subgraphs is developed that has worst-case time complexity of O(|E|Δ), where |E| is the number of edges in G and Δ is the maximum vertex degree in G. The study of maximal chordal subgraphs is motivated by their usefulness as computationally efficient structures with which to approximate a general graph. Two examples are given that illustrate potential applications of maximal chordal subgraphs. One provides an alternative formulation to the maximum independent set problem on a graph. The other involves a novel splitting scheme for solving large sparse systems of linear equations.     

Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs

Robert E. Jamison characterized chordal graphs by the edge set of every k-cycle being the symmetric difference of k−2 triangles. Strongly chordal (and chordal bipartite) graphs can be similarly characterized in terms of the distribution of triangles (respectively, quadrilaterals). These results motivate a definition of ‘strongly chordal bipartite graphs’, forming a class intermediate between bipartite interval graphs and chordal bipartite graphs.     

Counting labelled chordal graphs

An equation is derived which is satisfied by special types of generating functions for labelled chordal graphs. This enables calculation of the numbers of labelled chordal graphs with given numbers of cliques of given sizes. From this is determined the number ofn-vertex labelled chordal graphs with given connectivity. Calculations were completed forn≤13.     

A generalization of chordal graphs

In a 3-connected planar triangulation, every circuit of length ≥ 4 divides the rest of the edges into two nontrivial parts (inside and outside) which are “separated” by the circuit. Neil Robertson asked to what extent triangulations are characterized by this property, and conjectured an answer. In this paper we prove his conjecture, that if G is simple and 3-connected and every circuit of length ≥ 4 has at least two “bridges,” then G may be built up by “clique-sums” starting from complete graphs and planar triangulations. This is a generalization of Dirac's theorem about chordal graphs.     

Matrices with chordal inverse zero-patterns

We study matrices whose inverses exhibit a sparsity pattern that may be described with a chordal graph. Such matrices are characterized in terms of a special vanishing-minor structure, and an explicit entry-wise formula that is useful in certain matrix completion problems is derived.We also study an interesting graph-inheritance principle in the context of chordal graphs.     

Independent domination in chordal graphs

A graph chordal if it does not contain any cycle of length greater than three as an induced subgraph. A set of S of vertices of a graph G = (V,E) is independent if not two vertices in S are adjacent, and is dominating if every vertex in V?S is adjacent to some vertex in S. We present a linear algorithm to locate a minimum weight independent dominating set in a chordal graph with 0–1 vertex weights.     

Strange Duality and Polar Duality

A relation is described between Arnold's strange duality anda polar duality between the Newton polytopes which is mostlydue to M. Kobayashi. It is shown that this relation continuesto hold for the extension of Arnold's strange duality foundby C. T. C. Wall and the author. By a method of Ehlers–Varchenko,the characteristic polynomial of the monodromy of a hypersurfacesingularity can be computed from the Newton diagram. This methodis generalized to the isolated complete intersection singularitiesembraced in the extended duality. This is used to explain theduality of characteristic polynomials of the monodromy discoveredby K. Saito for Arnold's original strange duality and extendedby the author to the other cases.     

Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs

A forest is the clique complex of a strongly chordal graph and a quasi-forest is the clique complex of a chordal graph. Kruskal-Katona type theorems for forests, quasi-forests, pure forests and pure quasi-forests will be presented.     

Intersection models of weakly chordal graphs

We first present new structural properties of a two-pair in various graphs. A two-pair is used in a well-known characterization of weakly chordal graphs. Based on these properties, we prove the main theorem: a graph G is a weakly chordal ()-free graph if and only if G is an edge intersection graph of subtrees on a tree with maximum degree 4. This characterizes the so called [4, 4, 2] graphs. The proof of the theorem constructively finds the representation. Thus, we obtain an algorithm to construct an edge intersection model of subtrees on a tree with maximum degree 4 for such a given graph. This is a recognition algorithm for [4, 4, 2] graphs.     

Cover-incomparability graphs and chordal graphs

The problem of recognizing cover-incomparability graphs (i.e. the graphs obtained from posets as the edge-union of their covering and incomparability graph) was shown to be NP-complete in general [J. Maxová, P. Pavlíkova, A. Turzík, On the complexity of cover-incomparability graphs of posets, Order 26 (2009) 229-236], while it is for instance clearly polynomial within trees. In this paper we concentrate on (classes of) chordal graphs, and show that any cover-incomparability graph that is a chordal graph is an interval graph. We characterize the posets whose cover-incomparability graph is a block graph, and a split graph, respectively, and also characterize the cover-incomparability graphs among block and split graphs, respectively. The latter characterizations yield linear time algorithms for the recognition of block and split graphs, respectively, that are cover-incomparability graphs.     

Introducing subclasses of basic chordal graphs

Basic chordal graphs arose when comparing clique trees of chordal graphs and compatible trees of dually chordal graphs. They were defined as those chordal graphs whose clique trees are exactly the compatible trees of its clique graph.In this work, we consider some subclasses of basic chordal graphs, like hereditary basic chordal graphs, basic DV and basic RDV graphs, we characterize them and we find some other properties they have, mostly involving clique graphs.     

Geodeticity of the contour of chordal graphs

A vertex v is a boundary vertex of a connected graph G if there exists a vertex u such that no neighbor of v is further away from u than v. Moreover, if no vertex in the whole graph V(G) is further away from u than v, then v is called an eccentric vertex of G. A vertex v belongs to the contour of G if no neighbor of v has an eccentricity greater than the eccentricity of v. Furthermore, if no vertex in the whole graph V(G) has an eccentricity greater than the eccentricity of v, then v is called a peripheral vertex of G. This paper is devoted to study these kinds of vertices for the family of chordal graphs. Our main contributions are, firstly, obtaining a realization theorem involving the cardinalities of the periphery, the contour, the eccentric subgraph and the boundary, and secondly, proving both that the contour of every chordal graph is geodetic and that this statement is not true for every perfect graph.