Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
Abstract. During this decade, it has been observed that many realworld graphs, like the web and some social and metabolic networks, have a scale-free structure. These graphs are ch...
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...
In clique tree clustering, inference consists of propagation in a clique tree compiled from a Bayesian network. In this paper, we develop an analytical approach to characterizing ...
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...