39 citations · 193 across the 19 of their papers we have counts for
1 paper · 1 filter
Péter L. Erdős, István Miklós, Zoltán Toroczkai
One of the simplest ways to decide whether a given finite sequence of positive integers can arise as the degree sequence of a simple graph is the greedy algorithm of Havel and Haki…