Structural results on maximal k-degenerate graphs
Structural results on maximal k-degenerate graphs
A graph is k-degenerate if its vertices can be successively deleted so that when deleted, each has degree at most k.These graphs were introduced by Lick and White in 1970 and have been studied in several subsequent papers.We present sharp bounds on the diameter of maximal k-degenerate graphs and characterize …