Abstract :
Transchordal graphs generalize chordal graphs in terms of those aspects that seem particularly relevant to applications. In particular, transchordal graphs are defined as intersection graphs (only with circuit bases somewhat taking the place of spanning trees), they support a greedy construction that extends the notion of clique tree, and they have a combinatorial characterization that resembles two previous characterizations of chordal graphs.
