A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Clique graph representations of ptolemaic graphs
2010
Discussiones Mathematicae Graph Theory
A graph is ptolemaic if and only if it is both chordal and distancehereditary. Thus, a ptolemaic graph G has two kinds of intersection graph representations: one from being chordal, and the other from being distance-hereditary. The first of these, called a clique tree representation, is easily generated from the clique graph of G (the intersection graph of the maximal complete subgraphs of G). The second intersection graph representation can also be generated from the clique graph, as a very
doi:10.7151/dmgt.1520
fatcat:laqtj6bp3rcpziv2zmw3dixhr4