• New approach to the k-independence number of a graph 

      Caro, Yair; Hansberg Pastor, Adriana (2013)
      Article
      Accés obert
      Let G = (V,E) be a graph and k > 0 an integer. A k-independent set S V is a set of vertices such that the maximum degree in the graph induced by S is at most k. With k(G) we denote the maximum cardinality of a k-independent ...