We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that ca...
Cornelia Dangelmayr, Stefan Felsner, William T. Tr...
We introduce a class of graphs called an intersecting clustered graph that is a clustered graph with intersections among clusters. We propose a novel method for nicely drawing the...
Abstract. In this paper we examine spectral properties of random intersection graphs when the number of vertices is equal to the number of labels. We call this class symmetric rand...
Sotiris E. Nikoletseas, Christoforos Raptopoulos, ...
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
: Gavril [GA4] defined two new families of intersection graphs: the interval-filament graphs and the subtree-filament graphs. The complements of intervalfilament graphs are the coi...