Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
A block graph is a graph whose blocks are cliques. A block duplicate (BD) graph is a graph obtained by adding true twins (i.e., adjacent vertices with the same closed neighborhood...
Any given graph can be embedded in a chordal graph by adding edges, and the resulting chordal graph is called a triangulation of the input graph. In this paper we study minimal tr...
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...
The edge clique graph of a graph G is one having as vertices the edges of G, two vertices being adjacent if the corresponding edges of G belong to a common clique. We describe cha...