1 citations · 1 across the 3 of their papers we have counts for
1 paper · 1 filter
Sergey Ivanov
For a graph G, its vertex deck is the multiset of graphs obtained by deleting one vertex. Bowler, Brown, and Fenner (BBF) proposed 2⌊(n−1)/3⌋ as the maximum possibl…