The authors present a succinct data structure for chordal graphs with bounded vertex leafage that supports efficient adjacency and neighborhood queries.
