1 citations · 1 across the 5 of their papers we have counts for
1 paper · 1 filter
James Dylan Douthitt, James Oxley
A graph is chordal if every cycle of length at least four has a chord. In 1961, Dirac characterized chordal graphs as those graphs that can be built from complete graphs by repeate…