6 citations · 17 across the 11 of their papers we have counts for
1 paper · 1 filter
David Bergman, Carlos H. Cardonha, Andre A. Cire +1
A graph is chordal if every cycle of length at least four contains a chord, that is, an edge connecting two nonconsecutive vertices of the cycle. Several classical applications in…