2 citations · 6 across the 8 of their papers we have counts for
1 paper · 2 filters
Helena Bergold, Winfried Hochstättler, Uwe Mayer
We study the neighborhood polynomial and the complexity of its computation for chordal graphs. The neighborhood polynomial of a graph is the generating function of subsets of its v…