Lower bounds for constant degree independent sets

Michael O. Albertson, Debra L. Boutin
1994 Discrete Mathematics  
Let c(* denote the maximum number of independent vertices all of which have the same degree. We provide lower bounds for G(* for graphs that are planar, maximal planar, of bounded degree, or trees.
doi:10.1016/0012-365x(92)00463-2 fatcat:bhb5kda65vhijas2jiz6h356su