Every finite planar graph has a vertex of degree five or less; therefore, every planar graph is 5-degenerate, and the degeneracy of any planar graph is at most five.
The Barabási-Albert model for generating random scale-free networks[REF] is parameterized by a number m such that each vertex that is added to the graph has m previously-added vertices.