Abstract
We count labelled chordal graphs with no induced path of length 3,
both exactly and asymptotically. These graphs correspond to rooted
trees in which no vertex has exactly one child, and each vertex has
been expanded to a clique. Some properties of random graphs of this
type are also derived. The corresponding unlabelled graphs
... read more